Cosmological lower bound on the circuit complexity of a small problem in logic

Journal of the ACM

Volumn 49, Issue 6, 2002, Pages 753-784

  Stockmeyer, Larry ^a   Meyer, Albert R ^b,c  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Circuit complexity; Computational complexity; Decision problem; Logic; Lower bound; Practical undecidability; WS1S

Indexed keywords

CIRCUIT COMPLEXITY; DECISION PROBLEM; DIAGONALIZATION; PRACTICAL UNDECIDABILITY;

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; NETWORKS (CIRCUITS); POLYNOMIALS; PROTONS; THEOREM PROVING;

PROBABILISTIC LOGICS;

EID: 4243137233     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/602220.602223     Document Type: Article

References (86)

1. ADLEMAN, L. 1978. Two theorems on random polynomial time. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 75-83.
2. ADLEMAN, L. M., DEMARRAIS, J., AND HUANG, M.-D. A. 1997. Quantum computability. SIAM J. Comput. 26, 1524-1540.
3. AHARONOV, D. 1998. Quantum computation-A review. In Annual Reviews of Computational Physics, Vol. IV, D. Stauffer, Ed. World Scientific Press, River Edge, N.J.
4. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
5. 1-formulae on finite structures. Ann. Pure Appl. Logic 24, 1-48.
6. AJTAI, M. 1996. Generating hard instances of lattice problems. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing. ACM, New York. Full version: Report TR96-007, Electronic Colloquium on Computational Complexity, http://www.eccc.uni-trier.de/eccc/.
7. ALLENDER, E. 2001. Some pointed questions concerning asymptotic lower bounds and news from the isomorphism front. In Current Trends in Theoretical Computer Science, C. Paun, G. Rozenberg, and A. Salomaa, Eds. World Scientific Press, River Edge, N.J., 25-41.
8. ALON, N., AND BOPPANA, R. B. 1987. The monotone circuit complexity of Boolean functions. Combinatorica 7, 1-23.
9. ANDREEV, A. E. 1985. On a method for obtaining lower bounds for the complexity of individual monotone functions. Dokl. Ak. Nauk SSSR 282, 1033-1037. English translation in Sov. Math. Dokl. 31, 530-534.
10. ANDREEV, A. E. 1985. On a method for obtaining lower bounds for the complexity of individual monotone functions. Dokl. Ak. Nauk SSSR 282, 1033-1037. English translation in Sov. Math. Dokl. 31, 530-534.
11. BAKER, T., GILL, J., AND SOLOVAY, R. 1975. Relativizations of the P=? NP question. SIAM J. Comput. 4, 431-442.
12. A with probability 1. SIAM J. Comput. 10, 96-113.
13. BERMAN, L. 1980. The complexity of logical theories. Theoret. Comput. Sci. 11, 71-77.
14. BERMAN, L., AND HARTMANIS, J. 1977. On isomorphisms and density of NP and other complete sets. SIAM J. Comput. 6, 305-322.
15. BERNSTEIN, E., AND VAZIRANI, U. 1997. Quantum complexity theory. SIAM J. Comput. 26, 1411-1473.
16. BLUM, M. 1966. Recursive function theory and speed of computation. Canadian Math. Bull. 9, 745-749.
17. BLUM, N. 1984. A Boolean function requiring 3n network size. Theoret. Comp. Sci. 28, 337-345.
18. BOPPANA, R. B., AND SIPSER, M. 1990, The complexity of finite functions. In Handbook of Theoretical Computer Science, Volume A, Algorithms and Complexity, J. van Leeuwen, Ed. Elsevier, New York, Chapter 14, 757-804.
19. BORODIN, A. 1977. On relating time and space to size and depth. SIAM J. Comput. 6, 733-743.
20. BÜCHI, J. R. 1960. Weak second order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66-92.
21. CHAITIN, G. J. 1995. The Berry paradox. Complexity 1, 26-30.
22. CHANDRA, A. K., KOZEN, D. C., AND STOCKMEYER, L. J. 1981. Alternation. J. ACM 28, 114-133.
23. COBHAM, A. 1965. The intrinsic computational difficulty of functions. In Proceedings of the 1964 International Congress for Logic, Methodology and Philosophy of Science, Y. Bar-Hillel, Ed. North-Holland, Amsterdam, 24-30.
24. COOK, S. A. 1971. The complexity of theorem proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, 151-158.
25. DEUTSCH, D. 1989. Quantum computational networks. Proc. Roy. Soc. Land. A 425, 73-90.
26. DONNE, P. E. 1988. The Complexity of Boolean Networks. Academic Press, New York.
27. EDMUNDS, J. 1965. Paths, trees and flowers. Canad. J. Math. 17, 449-467.
28. EHRENFEUCHT, A. 1975. Practical decidability. J. Comput. Syst. Sci. 11, 392-396.
29. ELGOT, C. C. 1961. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21-51.
30. FISCHER, M. J., AND RABIN, M. O. 1974. Super-exponential complexity of Presburger arithmetic. In Complexity of Computation, SIAM-AMS Proceedings, vol. 7, R. Karp, Ed. American Mathematical Society, Providence, R.I., 27-42.
31. FURST, M., SAXE, M., AND SIPSER, M. 1984. Parity, circuits, and the polynomial time hierarchy. Math. Syst. Theory 17, 13-27.
32. GILL, J. 1977. Computational complexity of probabilistic Turing machines. SIAM J. Comput. 6, 675-695.
33. GUREVICH, Y. 1991. Average case completeness. J. Comput. Syst. Sci. 42, 346-398.
34. HARPER, L. H., HSIEH, W. N., AND SAVAGE, J. E. 1975. A class of Boolean function with linear combinational complexity. Theoret. Comput. Sci. 1, 161-183.
35. HARRISON, M. A. 1965. Introduction to Switching and Automata Theory. McGraw-Hill, New York.
36. HARTMANIS, J., AND STEARNS, R. E. 1965. On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117, 285-306.
37. HÅSTAD, J. 1986. Almost optimal lower bounds for small depth circuits. In Advances in Computer Research, Vol. 5: Randomness and Computation, S. Micali, Ed. JAI Press, Greenwich, CT.
38. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
39. IMPAGLIAZZO, R., AND WIGDERSON, A. 1997. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. ACM, New York, 220-229.
40. KANNAN, R. 1982. Circuit-size lower bounds and non-reducibility to sparse sets. Inf. Cont. 55, 40-56.
41. KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. Plenum Press, New York, 85-103.
42. KARP, R. M., AND LIPTON, R. J. 1980. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing. ACM, New York, 302-309.
43. KNUTH, D. E. 1969. The An of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Mass.
44. KNUTH, D. E. 1976. Mathematics and computer science: coping with finiteness. Science 194, 1235-1242. Reprinted in: D. E. Knuth, Selected Papers in Computer Science, Cambridge University Press, Cambridge, UK, 1996.
45. KNUTH, D. E. 1976. Mathematics and computer science: coping with finiteness. Science 194, 1235-1242. Reprinted in: D. E. Knuth, Selected Papers in Computer Science, Cambridge University Press, Cambridge, UK, 1996.
46. LEVIN, L. A. 1973. Universal sorting problems. Problemy Peredaci Informacii 9, 115-116. English translation in Prob. Inf. Trans. 9, 265-266.
47. LEVIN, L. A. 1973. Universal sorting problems. Problemy Peredaci Informacii 9, 115-116. English translation in Prob. Inf. Trans. 9, 265-266.
48. LEVIN, L. A. 1986. Average case complete problems. SIAM J. Comput. 15, 285-286.
49. LI, M., AND VITÁNYI, P. M. 1990. Kolmogorov complexity and its applications. In Handbook of The-oretical Computer Science, Volume A, Algorithms and Complexity, J. van Leeuwen, Ed. Elsevier, New York, Chapter 4, 187-254.
50. LUPANOV, O. B. 1958. Ob odnom metode sinteza skhem. Izy. VUZ (Radiofizika) 1, 120-140.
51. MEYER, A. R. 1975, Weak monadic second-order theory of successor is not elementary-recursive. In Logic Colloquium: Symposium on Logic Held at Boston 1972-73. Lecture Notes in Mathematics, vol. 453, R. Parikh, Ed. Springer-Verlag, Berlin, 132-154.
52. MEYER, A. R., AND MCCREIGHT, E. M. 1971. Computationally complex and pseudo-random zero-one valued functions. In Theory of Machines and Computations. Academic Press, New York, 19-42.
53. MEYER, A. R., AND STOCKMEYER, L. J. 1972. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory. IEEE Computer Society Press, Los Alamitos, Calif., 125-129.
54. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK.
55. NIELSEN, M. A., AND CHUANG, I. L. 2000. Quantum Computation and Quantum Information Theory. Cambridge University Press, Cambridge, UK.
56. OSHERSON, D. 1995. Probability judgement. In An Invitation to Cognitive Science, Vol. 3: Thinking, 2nd ed., E. E. Smith and D. Osherson, Eds. MIT Press, Cambridge, MA.
57. PAUL, W. 1977. A 2.5n-lower bound on the combinational complexity of Boolean functions. SIAM J. Comput. 6, 427-443.
58. PIPPENGER, N. 1979. On simultaneous resource bounds. In Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 307-311.
59. PIPPENGER, N., AND FISCHER, M. J. 1979. Relations among complexity measures. J. ACM 26, 361-381.
60. POHL, R 1980. Beyond the Blue Event Horizon. Ballantine Books, New York, Chapter 12.
61. RABIN, M. O. 1960. Degree of difficulty of computing a function and a partial ordering of recursive sets. Tech. Rep. 2, Hebrew Univ., Jerusalem, Israel.
62. RABIN, M. O. 1976. Probabilistic algorithms. In Algorithms and Complexity, New Directions and Recent Trends, J. F. Traub, Ed. Academic Press, New York, 21-29.
63. RAZBOROV, A. A. 1985. Lower bounds on the monotone complexity of some Boolean functions. Dokl. Ak. Nauk SSSR 281, 798-801. English translation in Sov. Math. Dokl. 31, 354-357.
64. RAZBOROV, A. A. 1985. Lower bounds on the monotone complexity of some Boolean functions. Dokl. Ak. Nauk SSSR 281, 798-801. English translation in Sov. Math. Dokl. 31, 354-357.
65. ROBERTSON, E. L. 1974. Structure of complexity in the weak monadic second-order theories of the natural numbers. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing. ACM, New York, 161-171.
66. ROGERS, JR., H. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York.
67. RUZZO, W. L. 1981, On uniform circuit complexity. J. Comput. Syst. Sci. 22, 365-383.
68. SAVAGE, J. E. 1972. Computational work and time on finite machines. J. ACM 19, 660-674.
69. SAVAGE, J. E. 1976. The Complexity of Computing. Wiley, New York.
70. SCARPELLINI, B. 1985. Complex Boolean networks obtained by diagonalization. Theoret. Comput. Sci. 36, 119-125.
71. SCHNORR, C. P. 1974. Zwei lineare untere shranken für die komplexität Boolescher funktionen. Computing 13, 155-171.
72. SCHNORR, C. P. 1976a, A lower bound on the number of additions in monotone computations. Theoret. Comp. Sci. 2, 305-315.
73. SCHNORR, C. P. 1976b. The network complexity and the Turing machine complexity of finite functions. Acta Inform. 7, 95-107.
74. SHANNON, C. E. 1949. The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28, 59-98.
75. SHOLOMOV, L. A. 1975. On one sequence of functions which is hard to compute. Mat. Zametki 17, 957-966.
76. SOLOVAY, R., AND STRASSEN, V. 1977. A fast Monte-Carlo test for primality. SIAM J. Comput. 6, 84-85. Erratum: SIAM J. Comput. 7, 118.
77. SOLOVAY, R., AND YAO, A. 1996. Manuscript, not yet published.
78. STOCKMEYER, L. J. 1974. The complexity of decision problems in automata theory and logic. Tech. Rep. MAC TR-133, MIT Project MAC, Cambridge, MA.
79. STOCKMEYER, L. J. 1977a. On the combinational complexity of certain symmetric Boolean functions. Math. Syst. Th. 10, 323-366.
80. STOCKMEYER, L. J. 1977b. The polynomial-time hierarchy. Theoret. Comput. Sci. 3, 1-22.
81. STOCKMEYER, L. J. 1987. Classifying the computational complexity of problems. J. Symb. Logic 52, 1-43.
82. STOCKMEYER, L. J., AND CHANDRA, A. K. 1979. Intrinsically difficult problems. Sci. Amer. 240, May, 140-159.
83. WEGENER, I. 1987. The Complexity of Boolean Functions. Wiley-Teubner, New York, Stuttgart.
84. WILSON, C. B. 1985. Relativized circuit complexity. J. Comput. Syst. Sci. 31, 169-181.
85. YAO, A.C. 1985. Separating the polynomial-time hierarchy by oracles. In Proceedings of the 26rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 1-10.
86. YAO, A. C. 1993. Quantum circuit complexity. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 352-361.