Algebrization: A new barrier in complexity theory

ACM Transactions on Computation Theory

Volumn 1, Issue 1, 2009, Pages

  Aaronson, Scott ^a   Wigderson, Avi ^b  

^a Department of Electrical Engineering and Computer Science   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Arithmetization; Communication complexity; Interactive proofs; Low degree polynomials; Oracles; Query complexity

Indexed keywords

ALGEBRAIC QUERIES; BASIC RESULTS; CIRCUIT LOWER BOUNDS; COMMUNICATION COMPLEXITY; COMPLEXITY CLASS; COMPLEXITY THEORY; FINITE FIELDS; INNER PRODUCT; INTERACTIVE PROOFS; LOWER BOUNDS; NATURAL PROOFS; NEW MODEL; OPEN PROBLEMS; QUERY COMPLEXITY; SUPERLINEAR;

ALGEBRA; COMPUTATIONAL COMPLEXITY; INCLUSIONS; INTERNET PROTOCOLS; PLASMA WAVES;

COMMUNICATION;

EID: 70350664499     PISSN: 19423454     EISSN: 19423462     Source Type: Journal    
DOI: 10.1145/1490270.1490272     Document Type: Article

References (40)

1. AARONSON, S. 2006. Oracles are subtle but not malicious. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA. 340-354.
2. ARORA, S., IMPAGLIAZZO, R., AND VAZIRANI, U. 1992. Relativizing versus nonrelativizing techniques: The role of local checkability. (http://www.cs. berkeley.edu/~vazirani/pubs/relativizing.ps).
3. BABAI, L., FORTNOW, L., AND LUND, C. 1991. Nondeterministic exponential time has two-prover interactive protocols. Computat. Complex. 1, 1, 3-40.
4. BAKER, T., GILL, J., AND SOLOVAY, R. 1975. Relativizations of the P=?NP question. SIAM J. Comput. 4, 431-442.
5. BENNETT, C. H. AND GILL, J. 1981. Relative to a random oracle A, PA 6= NPA 6= coNPA with probability 1. SIAM J. Comput. 10, 1, 96-113.
6. BUHRMAN, H., FORTNOW, L., AND THIERAUF, T. 1998. Nonrelativizing separations. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 8-12.
7. BUHRMAN, H., VERESHCHAGIN, N., AND DE WOLF, R. 2007. On computation and communication with small bias. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA, 24-32.
8. BUHRMAN, H. AND DE WOLF, R. 2002. Complexity measures and decision tree complexity: A survey. Theoret. Comput. Sci. 288, 21-43.
9. FEIGE, U. AND KILIAN, J. 1997. Making games short. In Proceedings of the ACM Annual Symposium on Theory of Computing. ACM, New York. 506-516.
10. FORTNOW, L. 1994. The role of relativization in complexity theory. Bull. EATCS 52, 229-244.
11. FURST, M., SAXE, J. B., AND SIPSER,M. 1984. Parity, circuits, and the polynomial time hierarchy. Math. Syst. Theory 17, 13-27.
12. GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1991. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38, 1, 691-729.
13. HARTMANIS, J., CHANG, R., CHARI, S., RANJAN, D., AND ROHATGI, P. 1992. Relativization: A revisionistic perspective. Bull. EATCS 47, 144-153.
14. HARTMANIS, J. AND STEARNS, R. E. 1965. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285-306.
15. HOPCROFT, J. E., PAUL, W. J., AND VALIANT, L. G. 1977. On time versus space. J. ACM 24, 2, 332-337.
16. IMPAGLIAZZO, R., KABANETS, V., AND WIGDERSON, A. 2002. In search of an easy witness: Exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65, 4, 672-694.
17. JUMA, A., KABANETS, V., RACKOFF, C., AND SHPILKA, A. 2007. The black-box query complexity of polynomial summation. ECCC TR07-125.
18. KALYANASUNDARAM, B. AND SCHNITGER, G. 1992. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math 5, 4, 545-557.
19. KANNAN, R. 1982. Circuit-size lower bounds and non-reducibility to sparse sets. Inf. Cont. 55, 40-56.
20. KARCHMER, M. AND WIGDERSON, A. 1990. Monotone circuits for connectivity require superlogarithmic depth. SIAM J. Comput. 3, 255-265.
21. KLAUCK, H. 2003. Rectangle size bounds and threshold covers in communication complexity. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA. 118-134. cs.CC/0208006.
22. KLIVANS, A. AND VAN MELKEBEEK, D. 2002. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAMJ. Comput. 31, 1501-1526. (Earlier version in Proceedings of the ACM Annual Symposium on Theory of Computing) 1999.
23. LUND, C., FORTNOW, L., KARLOFF, H., AND NISAN, N. 1992. Algebraic methods for interactive proof systems. J. ACM 39, 859-868.
24. PAUL, W. J., PIPPENGER, N., SZEMEŔEDI, E., AND TROTTER, W. T. 1983. On determinism versus non-determinism and related problems. In Proceedings of the IEEE Conference on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 429-438.
25. RAZ, R. 1999. Exponential separation of quantum and classical communication complexity. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York. 358-367.
26. RAZ, R. AND SHPILKA, A. 2004. On the power of quantum proofs. In Proceedigns of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA. 260-274.
27. RAZBOROV, A. A. 1987. Lower bounds for the size of circuits of bounded depth with basis- &,? . Mathematicheskie Zametki 41, 4, 598-607. (English translation inMath. Notes. Acad. Sci. USSR 41, 4, 1987) 333-338.
28. RAZBOROV, A. A. 1992. On the distributional complexity of disjointness. Theoret. Comput. Sci. 106, 385-390.
29. RAZBOROV, A. A. 2003. Quantum communication complexity of symmetric predicates. Izvestiya Math. (English version) 67, 1, 145-159. quant-ph/0204025.
30. RAZBOROV, A. A. AND RUDICH, S. 1997. Natural proofs. J. Comput. Sys. Sci. 55, 1, 24-35.
31. SANTHANAM, R. 2007. Circuit lower bounds for Merlin-Arthur classes. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York. 275-283.
32. SHAMIR, A. 1992. IP=PSPACE. J. ACM 39, 4, 869-877.
33. SMOLENSKY, R. 1987. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the ACM Symposium on Theory of Computing. ACM, New York. 77-82.
34. TODA, S. 1991. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 5, 865-877.
35. TREVISAN, L. AND VADHAN, S. 2002. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, CA. 129-138.
36. VAN MELKEBEEK, D. 2007. A survey of lower bounds for satisfiability and related problems. Foundations and Trends in Theoretical Computer Science 2, 197-303. ECCC TR07-099.
37. VINODCHANDRAN, N. V. 2004. A note on the circuit complexity of PP. ECCC TR04-056.
38. WIGDERSON, A. 1990. Information theoretic reasons for computational difficulty. In Proceedings of the International Congress of Mathematicians. 1537-1548.
39. YAO, A. C.-C. 1985. Separating the polynomial-time hierarchy by oracles (preliminary version). In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 1-10.
40. YAO, A. C.-C. 1986. How to generate and exchange secrets (extended abstract). In Proceedings of the IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA. 162-167.