De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Pseudo-random graphs and bit probe schemes with one-sided error
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
A dichotomy for local small-bias generators
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Exponential quantum speed-ups are generic
Quantum Information & Computation
| Hi-index | 0.00 |
We prove that poly-sized AC^0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan [LN90]. The only prior progress on the problem was by Bazzi [Baz07], who showed that O(log^2 n)-independent distributions fool poly-size DNF formulas. Razborov [Raz08] has later given a much simpler proof for Bazzi’s theorem.