Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107)
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: Weak derandomization of weak algorithms: explicit versions of Yao's lemma |
scientific article; zbMATH DE number 6085137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weak derandomization of weak algorithms: explicit versions of Yao's lemma |
scientific article; zbMATH DE number 6085137 |
Statements
Weak derandomization of weak algorithms: explicit versions of Yao's lemma (English)
0 references
21 September 2012
0 references
derandomization
0 references
randomness extractors
0 references
pseudorandomness
0 references
communication complexity
0 references
circuit complexity
0 references
0 references
0 references
0 references
0.783218264579773
0 references
0.75994473695755
0 references
0.75994473695755
0 references
0.7559787034988403
0 references
0.7542404532432556
0 references
