Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Combinatorics, Probability and Computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |