An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers

Evgeny Demenkov, Alexander S. Kulikov. An Elementary Proof of 3n-o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. Electronic Colloquium on Computational Complexity (ECCC), 18:26, 2011. [doi]

Abstract

Abstract is missing.