An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers (Q3088045)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers |
scientific article |
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
