Algebrization: A New Barrier in Complexity Theory
暂无分享,去创建一个
[1] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[2] M. Douglas McIlroy. The Number of 1's in Binary Integers: Bounds and Extremal Properties , 1974, SIAM J. Comput..
[3] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[4] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..
[5] A. K. Chandra,et al. Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[6] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[7] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[8] Ravi Kannan,et al. Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..
[9] Christopher B. Wilson. Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[10] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[12] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[13] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[14] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[15] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[16] Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[17] Avi Wigderson,et al. Information Theoretic Reasons for Computational Difficulty , 1990 .
[18] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[19] Avi Wigderson,et al. Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..
[20] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[21] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[22] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[23] Adi Shamir,et al. IP = PSPACE , 1992, JACM.
[24] Sanjeev Arora,et al. Relativizing versus Nonrelativizing Techniques: The Role of Local Checkability , 1992 .
[25] Lance Fortnow,et al. The Role of Relativization in Complexity Theory , 1994, Bull. EATCS.
[26] Alexander A. Razborov,et al. Natural Proofs , 2007 .
[27] Uriel Feige,et al. Making games short (extended abstract) , 1997, STOC '97.
[28] Avi Wigderson,et al. Quantum vs. classical communication and computation , 1998, STOC '98.
[29] Lance Fortnow,et al. Nonrelativizing separations , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).
[30] Dieter van Melkebeek,et al. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.
[31] Ran Raz,et al. Exponential separation of quantum and classical communication complexity , 1999, STOC '99.
[32] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[33] Avi Wigderson,et al. In search of an easy witness: exponential time vs. probabilistic polynomial time , 2002, J. Comput. Syst. Sci..
[34] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..
[35] Luca Trevisan,et al. Pseudorandomness and average-case complexity via uniform reductions , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[36] A. Razborov. Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.
[37] Hartmut Klauck,et al. Rectangle size bounds and threshold covers in communication complexity , 2002, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[38] N. V. Vinodchandran. A note on the circuit complexity of PP , 2005, Theor. Comput. Sci..
[39] Ran Raz,et al. On the power of quantum proofs , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[40] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[41] Richard Beigel. Perceptrons, PP, and the polynomial hierarchy , 2005, computational complexity.
[42] Carsten Lund,et al. Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.
[43] Andris Ambainis,et al. Quantum Search of Spatial Regions , 2005, Theory Comput..
[44] Scott Aaronson,et al. Oracles are subtle but not malicious , 2005, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[45] U. Feige,et al. Making Games Short , 2006 .
[46] Dieter van Melkebeek,et al. A Survey of Lower Bounds for Satisfiability and Related Problems , 2007, Found. Trends Theor. Comput. Sci..
[47] Luca Trevisan,et al. Pseudorandomness and Average-Case Complexity Via Uniform Reductions , 2007, computational complexity.
[48] Harry Buhrman,et al. On Computation and Communication with Small Bias , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[49] Rahul Santhanam. Circuit lower bounds for Merlin-Arthur classes , 2007, STOC '07.
[50] A. Wigderson,et al. Algebrization: a new barrier in complexity theory , 2008, STOC.
[51] Lance Fortnow,et al. Efficient learning algorithms yield circuit lower bounds , 2009, J. Comput. Syst. Sci..
[52] Ali Juma,et al. The Black-Box Query Complexity of Polynomial Summation , 2009, computational complexity.
[53] Scott Aaronson,et al. BQP and the polynomial hierarchy , 2009, STOC '10.