On the derandomization of constant depth circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 249-260

  Klivans, Adam R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM NUMBER GENERATION; RANDOM PROCESSES;

CONSTANT-DEPTH CIRCUITS; EXPONENTIAL FACTORS; HARDNESS AMPLIFICATION; INAPPROXIMABILITY; PARITY FUNCTIONS; POLYNOMIAL SIZE; PSEUDORANDOM GENERATORS; QUASI-POLY-NOMIAL;

APPROXIMATION ALGORITHMS;

EID: 84923103937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (27)

1. M. Ajtai. Σ11-Formulae on Finite Structures. Annals of Pure and Applied Logic, Vol. 24, 1983.
2. M. Ajtai. Approximate Counting with Uniform Constant-Depth Circuits. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, 1993.
3. M. Ajtai and M. Ben-Or. A Theorem on Probabilistic Constant Depth Computations. In ACM Symposium on Theory of Computing (STOC), 1984.
4. J. Aspnes, R. Beigel, M. Furst, and S. Rudich. The Expressive Power of Voting Polynomials. Combinatorica, 14(2), 1994.
5. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307–318, 1993.
6. P. Beame. A Switching Lemma Primer. Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University ofWashington, November 1994.
7. R. Beigel When do Extra Majority Gates Help? Polylog(n) Majority Gates are Equivalent to One. Computational Complexity, 4, 314-324, 1994.
8. R. Beigel, N. Reingold, and D. Spielman. The Perceptron Strikes Back. In Proceedings of the 6th Annual Conference on Structure in Complexity Theory (SCTC’91), June 1991.
9. M. Furst, J. Saxe, and M. Sipser. Parity, Circuits, and the Polynomial-Time Hierarchy. Mathematical Systems Theory, 17(1), 1984.
10. J. Håstad. Computational Limitations of Small Depth Circuits. MIT-PRESS, 1986.
11. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pages 538–545. IEEE, 1995.
12. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Near Optimal Conversion of Hardness into Pseudorandomness. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 538–545. IEEE, 1999.
13. R. Impagliazzo and A. Wigderson. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th ACM Symposium on the Theory of Computing, pages 220–229. ACM, 1997.
14. A. Klivans and D. van Melkebeek. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 659–667. ACM, 1999.
15. A. Klivans and R. Servedio. Boosting and Hard-Core Sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
16. N. Linial, Y. Mansour, and N. Nisan. Constant Depth Circuits, Fourier Transforms, and Learnability. Journal of the ACM, 40(3), July 1993.
17. M. Luby, B. Velickovic, and A. Wigderson. Deterministic Approximate Counting of Depth-2 Circuits. In Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993.
18. N. Nisan. Pseudorandom Bits for Constant Depth Circuits. Combinatorica, 11, 1991.
19. N. Nisan and A. Wigderson. Hardness vs. Randomness. Journal of Computer and System Sciences, 49:149–167, 1994.
20. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
21. A. Razborov. Lower Bounds on the Size of Bounded Depth Circuits over a Complete Basis with Logical Addition. MATHNAUSSR: Mathematical Notes of the Academ of Sciences of the USSR, 41, 1987.
22. R. Servedio. Smooth Boosting and Learning with Malicious Noise. To Appear, 2001.
23. R. Smolensky. Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, May 1987.
24. L. Stockmeyer. The Complexity of Approximate Counting. In ACM Symposium on Theory of Computing (STOC), 1983.
25. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Technical Report TR-98-074, Electronic Colloquium on Computational Complexity, 2000. Revision 2.
26. L. Trevisan. Construction of extractors using pseudo-random generators. In Proceedings of the 31st ACM Symposium on the Theory of Computing, pages 141–148. ACM, 1999.
27. L. Valiant and V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85–93, 1986.