Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13153
Title: On derandomization and average-case complexity of monotone functions
Institution and School/Department of submitter: Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών
Keywords: derandomization,monotone circuits,monotone functions,randomized algorithm,pseudorandom generators,average-case complexity,boolean functions,hardness,bounds
URI: https://olympias.lib.uoi.gr/jspui/handle/123456789/13153
ISSN: 0304-3975
Link: <Go to ISI>://000303903700004
http://ac.els-cdn.com/S0304397512001582/1-s2.0-S0304397512001582-main.pdf?_tid=56fa8ab4-873f-11e3-a7e0-00000aab0f6c&acdnat=1390819366_c3b9245363ffcfd6d4e10adede0eefff
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Karakostas-2012-On derandomization a.pdf246.4 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons