An elementary proof of a \(3n - o(n)\) lower bound on the circuit complexity of affine dispersers (Q3088045)
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: An elementary proof of a 3n - o(n) lower bound on the circuit complexity of affine dispersers |
scientific article; zbMATH DE number 5940107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An elementary proof of a \(3n - o(n)\) lower bound on the circuit complexity of affine dispersers |
scientific article; zbMATH DE number 5940107 |
Statements
An Elementary Proof of a 3nāāāo(n) Lower Bound on the Circuit Complexity of Affine Dispersers (English)
0 references
17 August 2011
0 references
0.8422329425811768
0 references
0.8222544193267822
0 references
0.7943194508552551
0 references
0.7503696084022522
0 references
0.7302237153053284
0 references
