On derandomization and average-case complexity of monotone functions (Q428873)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On derandomization and average-case complexity of monotone functions |
scientific article; zbMATH DE number 6049393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On derandomization and average-case complexity of monotone functions |
scientific article; zbMATH DE number 6049393 |
Statements
On derandomization and average-case complexity of monotone functions (English)
0 references
25 June 2012
0 references
derandomization
0 references
monotone circuits
0 references
monotone functions
0 references
randomized algorithm
0 references
pseudorandom generators
0 references
average-case complexity
0 references
0.8024932742118835
0 references
0.7973721623420715
0 references
0.7890397310256958
0 references
0.7887293696403503
0 references
0.7772853374481201
0 references
