P, NP and mathematics - A computational complexity perspective

International Congress of Mathematicians, ICM 2006

Volumn 1, Issue , 2006, Pages 665-712

  Wigderson, Avi ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Computational complexity; NP; P

Indexed keywords

COMPUTATIONAL COMPLEXITY THEORY; COMPUTATIONAL PROBLEM; EFFICIENT COMPUTATION; MATHEMATICAL PROBLEMS; NP PROBLEMS; THEORETICAL COMPUTER SCIENCE;

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES; NEPTUNIUM; PHOSPHORUS;

COMPUTATIONAL COMPLEXITY;

EID: 84878051606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (113)

1. Adleman, L., and Manders, K., Computational complexity of decision problems for polynomials. Proceedings of 16th IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1975, 169-177.
2. Agol, I., Hass, J., and Thurston, W. P., The Computational Complexity of Knot Genus and Spanning Area. Trans. Amer. Math. Sci. 358 (2006), 3821-3850.
3. Agrawal, M., Kayal, N., and Saxena, N., Primes is in P. Ann. of Math. 160 (2) (2004), 781-793.
4. Ajtai, M., Generating Hard Instances of Lattice Problems. Proceedings of the 28th annual ACM Symposium on Theory of Computing, ACM Press, NewYork 1996, 99-108.
5. Ajtai, M., Σ1-formulae on finite structures. Ann. Pure Appl. Logic 24 (1) (1983), 1-48.
6. Alon, N., and Boppana, R., The Monotone Circuit Complexity of Boolean Functions. Combinatorica 7 (1) (1987), 1-22.
7. Alon, N. and Spencer, J., The Probabilistic Method. 2nd edition, Wiley-Intersci. Ser. Discrete Math. Optim., JohnWiley, NewYork 2000.
8. Arora, S., Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. Thesis, UC Berkeley, 1994; revised version in http://eccc.hpi-web.de/eccclocal/ECCC-Books/sanjeev-book-readme.html.
9. Arora, S., Lund, C., Motwani, R., Sudan, M., and Szegedy, M., Proof verification and the hardness of approximation problems. J. ACM 45 (3) (1998), 501-555.
10. Babai, L., Trading group theory for randomness. In Proceedings of the 17th annual ACM Symposium on Theory of Computing, ACM Press, NewYork 1985, 421-429.
11. Babai, L., E-mail and the unexpected power of interaction. In Proceedings of the 5th Annual Conference on Structure in Complexity Theory, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990, 30-44.
12. Baker, T., Gill, J., and Solovay, R., Relativizations of the P = NP question. SIAM J. Comput. 4 (1975), 431-442.
13. Beame, P., and Pitassi, T., Propositional Proof Complexity: Past, Present, and Future. Bull. EATCS 65 (1998), 66-89.
14. Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A., Efficient Identification Schemes Using Two Prover Interactive Proofs. Advances in Cryptography (CRYPTO 89), Lecture Notes in Comput. Sci. 435, Springer-Verlag, Berlin 1989, 498-506.
15. Ben-Sasson, E., andWigderson, A., Short Proofs are Narrow - Resolution made Simple. Proceedings of the 31st annual ACM Symposium on Theory of Computing, ACM Press, NewYork 1999, 517-526.
16. Blum, L., Cucker, F., Shub, M., and Smale, S., Complexity and Real Computation. Springer-Verlag, 1998.
17. Blum, M., and Micali, S., How to generate chryptographically secure sequences of pseudorandom bits. SIAM J. Comput. 13 (1984), 850-864.
18. Boppana, R., and Sipser, M., The complexity of finite functions. In [72], 757-804.
19. Buss, S., Polynomial size proofs of the propositional pigeonhole principle. J. Symbolic Logic 52 (1987), 916-927.
20. Chvátal, V., Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 (1973), 305-337.
21. Chvátal, V., and Szemeredi, E., Many hard examples for resolution. J. ACM 35 (4) (1988), 759-768.
22. Clegg, M., Edmonds, J., and Impagliazzo, R., Using the Groebner BasisAlgorithm to Find Proofs of Unsatisfiability. Proceedings of the 28th annual ACM Symposium on Theory of Computing, ACM Press, NewYork 1996, 174-183.
23. Cobham, A., The intrinsic computational difficulty of functions. In Logic, Methodology, and Philosophy of Science, North Holland, Amsterdam 1965, 24-30.
24. Cook, S. A., The Complexity of Theorem-Proving Procedures. Proceedings of the 3rd annual ACMSymposium on Theory of Computing, ACMPress, NewYork 1971, 151-158.
25. Cook, S. A., The P vs. NP Problem. CLAY Mathematics Foundation Millenium Problems, http://www.claymath.org/millennium.
26. Cook, S. A., and Reckhow, R. A., The Relative Efficiency of Propositional Proof Systems. J. Symbolic Logic 44 (1979), 36-50.
27. Cormen, T. H., Leiserson, C., and Rivest, R., Introduction to Algorithms. 2nd edition, MIT Press, Cambridge, MA; McGraw-Hill Book Co., NewYork 2001.
28. Davis, M., Logemann, G., and Loveland, D., A machine program for theorem proving. J. ACM 5 (7) (1962), 394-397.
29. Diffie, W., and Hellman, M., New directions in cryptography. IEEE Trans. Information Theory 22 (1976), 644-654.
30. Dinur, I., The PCP Theorem by gap amplification. Proceedings of the 38th annual ACM Symposium on Theory of Computing, ACM Press, NewYork 2006, 241-250.
31. Dyer, M., Frieze, A., and Kannan, R., A random polynomial time algorithm for approximating the volume of a convex body. J. ACM 38 (1) (1991), 1-17.
32. Edmonds, J., Paths, Trees, and Flowers. Canad. J. Math. 17 (1965), 449-467.
33. Feige, U., Goldwasser, S., Lovasz, L., Safra, S., and Szegedy, M., Interactive proofs and the hardness of approximating cliques. J. ACM 43 (2) (1996), 268-292.
34. Fortnow, L., The role of relativization in complexity theory. Bull. EATCS 52 (1994), 229-244.
35. Furst, M., Saxe, J., and Sipser, M., Parity, circuits and the polynomial time hierarchy. Math. Systems Theory 17 (1984), 13-27.
36. Garey, M. R., and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness.W.H. Freeman and Company, NewYork 1979.
37. Gill, J., Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6 (1977), 675-695.
38. Goldreich, O., Notes on Levin's Theory of Average-Case Complexity. ECCC TR97-058, (1997).
39. Goldreich, O., Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms Combin. 17, Springer-Verlag, Berlin 1999.
40. Goldreich, O., Foundation of Cryptography. I. Basic Tools; II. Basic Applications, Cambridge University Press, Cambridge 2001; 2004.
41. Goldreich, O., Micali, S., andWigderson, A., Proofs thatYield Nothing but theirValidity, or All Languages in NP have Zero-Knowledge Proof Systems. J. ACM 38 (1) (1991), 691-729.
42. Goldreich, O., Micali, S., and Wigderson, A., Howto Play anyMental Game. Proceedings of the 19th annualACMSymposium on Theory of Computing, ACMPress, NewYork 1987, 218-229.
43. Goldwasser, S., Micali, S., Probabilistic encryption. J. Comput. System Sci. 28, (1984), 270-299.
44. Goldwasser, S., Micali, S., and Rackoff, C., The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput. 18 (1) (1989), 186-208.
45. Goldwasser, S., and Sipser, M., Private coins versus public coins in interactive proof systems. In Randomness and Computation (Silvio Micali, ed.), Advances in Computing Research 5, JAI Press, Inc., Greenwich, CT, 1989, 73-90.
46. Granville, A., It is easy to determine whether a given integer is prime. Bull. Amer. Math. Soc. 42 (2005), 3-38.
47. Gromov, M., Hyperbolic groups. In Essays in Group Theory (S. M. Gersten, ed.), Math. Sci. Res. Inst. Publ. 8, Springer-Verlag, NewYork 1987, 75-264.
48. Gromov, M., Random walk in random groups. Geom. Funct. Anal. 13 (1) (2003), 73-146.
49. Haken, A., The Intractability of Resolution. Theor. Comput. Sci. 39 (1985), 297-308.
50. Haken, W., Theorie der Normalflächen: Ein Isotopiekriterium für den Kreisknoten. Acta Math. 105 (1961), 245-375.
51. Hartmanis, J., Gödel, von Neumann and the P = NP problem. Bull. EATCS 38 (1989), 101-107.
52. Hass, J., Lagarias, J. C., The number of Reidemeister Moves Needed for Unknotting. J. Amer. Math. Soc. 14 (2001), 399-428.
53. Hass, J., Lagarias, J. C., and Pippenger, N., The Computational Complexity of Knot and Link Problems. J. ACM 46 (1999), 185-211.
54. 1-ε. Acta Math. 182 (1999), 105-142.
55. Håstad, J., Some optimal inapproximability results. J. ACM 48 (2001), 798-859.
56. Hochbaum, D. (ed.), Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston, MA, 1996.
57. Impagliazzo, R., A personal view of average-case complexity. Proceedings of the 10th IEEE Annual Conference on Structure in Complexity Theory, IEEE Comput. Soc. Press, Los Alamitos, CA, 1995, 134-147.
58. Impagliazzo, R., and Wigderson, A., P = BPP unless E has Subexponential Circuits: Derandomizing the XOR Lemma. Proceedings of the 29th annual ACM Symposium on Theory of Computing, ACM Press, NewYork 1997, 220-229.
59. Impagliazzo, R., and Wigderson, A., Randomness vs. Time: De-randomization under a uniform assumption. Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1998, 734-743.
60. Jerrum, M., Sinclair, A., Vigoda, E., A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51 (4) (2004), 671-697.
61. Johnson, D., The Tale of the Second Prover, J. Algorithms 13 (3) (1992), 502-524.
62. Kabanets, V., Impagliazzo, R., Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Comput. Complexity 13 (1-2) (2004), 1-46.
63. Kaltofen, E. Polynomial Factorization. In Computer Algebra: Symbolic and Algebraic Computation, 2nd ed., Springer-Verlag, Wien, NewYork 1983, 95-113.
64. Karchmer, M., and Wigderson, A., Monotone Circuits for Connectivity require Super- Logarithmic Depth. SIAM J. Discrete Math. 3 (2) (1990), 255-265.
65. Karmarkar, N., A New Polynomial-Time Algorithm for Linear Programming. Combinatorica 4 (1984), 373-394.
66. Karp, R., Reducibility among combinatorial problems. In Complexity of Computer Computations (R. E. Miller and J.W. Thatcher, eds.), Plenum Press, NewYork 1972, 85-103.
67. Karp, R., and Lipton, R. J., Turing machines that take advice. Enseign. Math. (2) 28 (3-4) (1982), 191-209.
68. Khachian, L., Apolynomial time algorithm for linear programming. Soviet Math. Doklady 10 (1979), 191-194.
69. Kitaev, A., Shen, A., and Vyalyi, M., Classical and Quantum Computation. Grad. Stud. Math. 47, Amer. Math. Soc., Providence, R.I., 2002.
70. Kushilevitz, E., and Nisan, N., Communication Complexity. Cambridge University Press, Cambridge 1997.
71. Ladner, R., On the Structure of Polynomial Time Reducibility. J. ACM 22 (1) (1975), 155-171.
72. van Leeuwen, J. (ed.), Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity. Elsevier Science Publishers, B.V., Amsterdam; MIT Press, Cambridge, MA, 1990.
73. Lenstra, A. K., Lenstra Jr., H. W., and Lovász, L. Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 515-534.
74. Levin, L. A., Universal search problems. Probl. Peredaci Inform. 9 (1973), 115-116; English transl. Probl. Inf. Transm. 9 (1973), 265-266.
75. Levin, L. A., Average Case Complete Problems. SIAM J. Comput. 15 (1) (1986), 285-286.
76. Levin, L. A., One-Way Functions and Pseudorandom Generators. Combinatorica 7 (4) (1987), 357-363.
77. Lund, C., Fortnow, L., Karloff, H., Nisan, N., Algebraic Methods for Interactive Proof Systems. Proceedings of the 31th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990, 2-10.
78. Miller, G.L., Riemann's Hypothesis and Tests for Primality. J. Comput. System Sci. 13 (3) (1976), 300-317.
79. Motwani, R., and Raghavan, P., Randomized Algorithms. Cambridge University Press, Cambridge 1995.
80. Nisan, N., and Wigderson, A., Hardness vs. Randomness. J. Comput. System Sci. 49 (2) (1994), 149-167.
81. Papadimitriou, C. H., Computational Complexity. AddisonWesley, Reading, MA, 1994.
82. Papadimitriou, C. H., On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. System Sci. 48 (3) (1994), 498-532.
83. Papadimitriou, C. H., NP-completeness: A retrospective. In Automata, languages and programming (ICALP'97), Lecture Notes in Comput. Sci. 1256, Springer-Verlag, Berlin 1997.
84. Pudlak, P., Lower bounds for resolution and cutting planes proofs and monotone computations. J. Symbolic Logic 62 (3) (1997), 981-998.
85. Rabin, M. O., Probabilistic algorithm for testing primality. J. Number Theory 12 (1980), 128-138.
86. Rabin, M., Mathematical theory of automata. In Mathematical Aspects of Computer Science, Proc. Sympos. Appl. Math. 19, Amer. Math. Soc., Providence, R.I., 1967, 153-175.
87. Raz, R., Resolution lower bounds for the weak pigeonhole principle. J.ACM 51 (2) (2004), 115-138.
88. Raz, R., and Wigderson, A., Monotone Circuits for Matching require Linear Depth. J.ACM 39 (1992), 736-744.
89. Razborov, A. A., Lower bounds for the monotone complexity of some Boolean functions. Dokl. Akad. Nauk SSSR 281 (4) (1985), 798-801; English transl. Soviet Math. Doklady 31 (1985), 354-357.
90. Razborov, A.A., Lower bounds of monotone complexity of the logical permanent function. Mat. Zametki 37 (6) (1985), 887-900; English transl. Math. Notes 37 (1985), 485-493.
91. Razborov, A. A., Lower Bounds for the Polynomial Calculus. Comput. Complexity 7 (4) (1998), 291-324.
92. Razborov, A. A., Resolution Lower Bounds for Perfect Matching Principles. J. Comput. System Sci. 69 (1) (2004), 3-27.
93. Razborov, A. A., and Rudich, S., Natural Proofs. J. Comput. System Sci. 55 (1) (1997), 24-35.
94. Robertson, N., and Seymour, P., Graph Minors I-XIII. J. Combin. Theory B (1983-1995).
95. Rudich, S., andWigderson, A. (eds.), Computational Complexity Theory. IAS/Park-City Math. Ser. 10, Institute for Advanced Studies/Amer. Math. Soc., 2000.
96. Schönhage, A., and Strassen, V., Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281- 292.
97. Schrijver, A., Combinatorial Optimization. Polyhedra and Efficiency. Algorithms Combin. 24, Springer-Verlag, Berlin 2003.
98. Schwartz, J. T., Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 (4) (1980), 701-717.
99. Shaltiel, R., Recent Developments in Explicit Constructions of Extractors. Bull. EATCS 77 (2002), 67-95.
100. Shamir, A., IP = PSPACE. J. ACM 39 (1992), 869-877.
101. Sipser, M., Introduction to the Theory of Computation. PWSPublishing Co., Boston, MA, 1997.
102. Sipser, M., The History and Status of the P versus NP Question. Proceedings of the 24th annual ACMSymposium on Theory of Computing, ACMPress, NewYork 1992, 603-618.
103. Smale, S., Mathematical Problems for the Next Century. In Mathematics: Frontiers and Perspectives, Amer. Math. Soc., Providence, RI, 2000, 271-294.
104. Solovay, R. M., and Strassen, V., A fast Monte-Carlo test for primality. SIAM J. Comput. 6 (1) (1977), 84-85.
105. Strassen, V., Algebraic Complexity Theory. In [72], 633-672.
106. Sudan, M., Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. ACM Distinguished Theses, Lecture Notes in Comput. Sci. 1001, Springer-Verlag, Berlin 1996.
107. Tardos, E., The Gap Between Monotone and Non-Monotone Circuit Complexity is Exponential. Combinatorica 7 (4) (1987), 141-142.
108. Tarski, A., A decision method for elementary algebra and geometry. University of California Press, 1951.
109. Valiant, L. G., Completeness classes in algebra. In Proceedings of the eleventh annual ACM Symposium on Theory of Computing (1979), 249-261.
110. exp -⊆ (NP ∩ coNP)/poly. Inform. Process. Lett. 89 (2004), 43-47.
111. Yao, A. C., Theory and application of trapdoor functions. Proceedings of the 23th annual IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1982, 80-91.
112. Yao, A. C., How to generate and exchange secrets. In Proceedings of the 27th annual IEEE Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, Los Alamitos, CA, 1986, 162-167.
113. Zippel, R. E., Probabilistic algorithms for sparse polynomials. In Symbolic and algebraic computation (EUROSCAM '79), Lecture Notes in Comput. Sci. 72, Springer-Verlag, Berlin 1979, 216-226.