An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers (Q3088045): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_25 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1756918770 / rank | |||
Normal rank | |||
Latest revision as of 01:56, 20 March 2024
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
