Article

Free access

The history and status of the P versus NP question

Author:

Michael SipserAuthors Info & Claims

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

Pages 603 - 618

https://doi.org/10.1145/129712.129771

Published: 01 July 1992 Publication History

PDF eReader

References

[1]

M. AJTAI, #-formulae on finite structures, Annals of Pure and Applied Logic 24, 1-48, 1983.

Crossref

Google Scholar

[2]

N. ALON AND P#. B. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica 7:1, 1-22, 1987.

Digital Library

Google Scholar

[3]

A.E. ANDREEV, On a method for obtaining lower bounds for the complexity of individual monotone functions, Doklady Akademii Nauk SSSR 282:5, 1033-1037 (in Russian). English translation in Soviet Mathematics DoUady 31:3, 530-534, 1985.

Google Scholar

[4]

G. ASSER, Das Repr#entatenproblem im PrKdikatenkalkiil der ersten Stufe mit identit#t, Zeitschrift fiir Matemitische Logic und Grundlagen der Mathematik, 1, 252-263, 1955.

Google Scholar

[5]

T. P. BAKER, J. GILL, AND R. SOLOVAY, Relativizations of the P=?NP question, SIAM Journal on Computing 4:4, 431-442, 1975.

Crossref

Google Scholar

[6]

D.A. BARRINGTOI#, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, Journal of Computer and System Sciences 38, 150-164, 1986.

Digital Library

Google Scholar

[7]

D.A. BARRINQTON, A note on a theorem of Razborov, manuscript, 1986.

Google Scholar

[8]

S. BEN-DAVID AND S. HALEVI, On the independence of P versus NP, Tech. Report #699, Technion, 1991.

Google Scholar

[9]

S.J. BERKOWITZ, On some relationships between monotone and non-monotone circuit complexity, Technical Report, Computer Science Department, University of Toronto, 1982.

Google Scholar

[10]

M. BLUM, A machine-independent theory of the complexity of recursive functions, Journal of the A CM, 14, no. 2, 322-336, 1967.

Digital Library

Google Scholar

[11]

N. BLUM, A Boolean function requiring 3n network size, Theoretical Computer Science 28, 337-345, 1984.

Crossref

Google Scholar

[12]

R.B. BOPPANA, Threshold functions and bounded depth monotone circuits, Journal of Computer and System Sciences 32:2,222-229, 1986.

Digital Library

Google Scholar

[13]

R.S. BOPPANA AND M. SIPSER, The complexity of finite functions, Handbook of Theoretical Computer Science, Elsevier, 758-804, 1990.

Digital Library

Google Scholar

[14]

S.R. Buss, Bounded Arilhmetic, Bibliopolis, 1986.

Google Scholar

[15]

A. COBHAM, The intrinsic computational difficulty of functions, Proc. of the 196# international Congress for Logic, Methodology, and lhe Philosophy of Science, edited by Y. Bar- Hillel, North-Holland, 24-30, 1964.

Google Scholar

[16]

A. K. CHANDRA, L. J. STOCKMEYER, AND U. VISHKIN, Constant depth reducibility, SIAM Journal on Compufiug 13:2, 423-439, 1984.

Crossref

Google Scholar

[17]

S.A. COOK, The complexity of theorem proving procedures, Proceedings of #he 3rd Annual A CM Symposium on Theory of Computing, 151-158, 1971.

Digital Library

Google Scholar

[18]

S.A. CooK, Feasably constructive proofs and the propositional calculus, Proceedings of the 7th Annual A CM Symposium on Theory of Computing, 83-97, 1975.

Digital Library

Google Scholar

[19]

S.A. COOK AND A. URQUHART, Functional interpretations of feasibly constructive arithmetic, Technical Report 210/88, Computer Science Department, University of Toronto, 1988.

Google Scholar

[20]

R.E. DEMILLO AND R. J. LIPTON, The consistency of P--NP and related problems within fragments of number theory, Proceedings of #he 11th ACM Symposium on Theory of Computing, 153-159, 1979.

Digital Library

Google Scholar

[21]

P.E. DUNNE, The Complexity of Boolean Networks, Academic Press, 1988.

Digital Library

Google Scholar

[22]

J. EDMONDS, Paths, trees, and flowers, Canadian Journal of Mathematics, 17, 449- 467, 1965.

Crossref

Google Scholar

[23]

J. EDMONDS, Minimum partition of a matroid into independent sets, Journal of Research of the National Bureau of Standards (B), 69, 67-72,

Google Scholar

[24]

J. EDMONDS, R. IMPAGLIAZZO, S. RUI)ICH, J. SGALL, Communication complexity towards lower bounds on circuit depth, Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 249-257, 1991.

Digital Library

Google Scholar

[25]

R. FAaIN, Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation, SIAM-AMS Proceedings 7, 43-73, 1974.

Google Scholar

[26]

L. FORTNOW AND M. SIPSER, Are there interactive protocols for eo-NP languages7 Information Processing Letters 28, 249--251, 1988.

Digital Library

Google Scholar

[27]

M. FURST, J. SAX#., AND M. SIr'SER, Parity, circuits and the polynomial time hierarchy, Mathematical Systems Theory 17, 13-27, 1984.

Crossref

Google Scholar

[28]

Z. GALm, On the complexity of regular resolution and the Davis-Putnam procedure, Theoretical Computer Science 4, 23-46, 1977.

Crossref

Google Scholar

[29]

M. GAR#.Y AND D. S. JOHNSON, Computers and Intractability: a guide to the theory of NP-completeness, Freeman, 1979.

Digital Library

Google Scholar

[30]

M. Goldmann, J. Hhstad, A lower bound for monotone clique using a communication game, manuscript, 1989.

Google Scholar

[31]

M. GRIGNI AND M. SIPSER, Monotone complexity, Proceedings of LMS workshop on Boolean Function Complexity, Durham, edited by M. S. Paterson, Cambridge University Press, 1990.

Digital Library

Google Scholar

[32]

M. GrUGNI AND M. SIPSZR, Monotone separation of N C1 from logspaee, Proceedings of the 6th Annual Symposium on Structure in Complexity Theory, 294-298, 1991.

Google Scholar

[33]

L.H. HARPER AND J. E. SAVAGE, The complexity of the marriage problem, Advances in Mathematics 9, 299-312, 1972.

Crossref

Google Scholar

[34]

J. HARTMANIS, GSdel, von Neumann and the P=?NP Problem, Bulletin of the European Association for Theoretical Computer Science, 101-107, June 1989.

Google Scholar

[35]

j. HARTMANIS AND j. HOPCROFT, Independence results in computer science, A CM SIGACT News 8, no. 4, 13-24, 1976.

Digital Library

Google Scholar

[36]

J. HARTMANIS AND P#. E. STEARNS, On the computational complexity of algorithms, Transactions of the AMS 117, 285-306, 1965.

Crossref

Google Scholar

[37]

A. HAKe, N, The intractability of resolution, Theoretical Computer Science 39, 297-308, 1985.

Crossref

Google Scholar

[38]

J. HASTAD, Computational Limitations for Small Depth Circuits, MIT Press, 1986.

Digital Library

Google Scholar

[39]

J. H),STAD, A. WmD#.RSON, Composition of the Universal Relation, manuscript, 1991.

Google Scholar

[40]

J.E. HOPCROFT AND J. D. ULLMAN, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

Digital Library

Google Scholar

[41]

i. IMMERMAN, Languages that capture complexity classes, SIAM Journal on Computing 16:4, 760-778, 1987.

Digital Library

Google Scholar

[42]

N. IMMERMAN, Nondeterministic space is closed under complement, SIAM Journal on Computing, 935-938, 1988.

Digital Library

Google Scholar

[43]

N.D. JONES AND A. L. SELMAN, Turing machines and the spectra of first-order formulas, Journal of Symbolic Logic 39, 139-150, 1974.

Crossref

Google Scholar

[44]

B. KALYANASUNDARAM AND G. SCHNIT- GER, The probabilistic communication complexity of set intersection, Proceedings of #he Second Annual Conference on Structure in Complexity Theory, 41-49, 1987.

Google Scholar

[45]

M. KARCHMER, R. RAZ, A. WIGDERSON, On proving super-logarithmic depth lower bounds via the direct sum in communication complexity, Proceedings of the Sixth Annual Conference on Structure in Complexity Theory, 1991.

Crossref

Google Scholar

[46]

M. KARCHMER AND A. WIGDERSON, Monotone circuits for connectivity require superlogarithmic depth, Proceedings of the 20th Annual A CM Symposium on Theory of Computing, 539-550, 1988.

Digital Library

Google Scholar

[47]

R.M. KARP, Reducibility among combinatorim problems, Complexity of Computer Computations, Plenum Press, 85-103, 1972.

Google Scholar

[48]

D. KOZEN, Lower bounds for natural proof systems, Proceedings of the 18th Annual Symposium on Foundations of Computer Science, 254-266, 1977.

Google Scholar

[49]

K. J. LANGE, B. JENNER, B, KIRSIG, The logarithmic hierarchy collapses: AEL = AII#, Proceedings of the 14th International Conference on Automata, Languages, and Programming, 1987.

Digital Library

Google Scholar

[50]

H. L#.B#.SGU#., Sur les fonetions repr#sentables analytiquement, Journal de Math. 6# serie 1, 139-216, 1905.

Google Scholar

[51]

L. LEVIN, Universal sequential search problems, Probl. Pered. Inform. IX 3, 1973; translation in Problems of Information Trans 9, 3, 265--266; corrected translation in Trakhtenxbrot {Tr84}.

Google Scholar

[52]

R.J. LIPTON, Model theoretic aspects of complexity theory, Proceeding of the 19th Annual Symposium on Foundations of Computer Science, 193-200, 1978.

Google Scholar

[53]

C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, Proceedings of 2#h Annual ACM Symposium on Theory of Computing, 2-10, 1990; to appear in the Journal of the A CM.

Digital Library

Google Scholar

[54]

A. R,. MEYER, AND L. J. STOCKMEYER, The equivalence problem for regular expressions with squaring requires exponential time, Proceedings of #he 13th Annual Symposium on Switching and Automata Theory, 125-129, 1972.

Digital Library

Google Scholar

[55]

Y.N. MOSCHOVAKIS, Descriptive Set Theory, North-Holland, 1980.

Google Scholar

[56]

D. E. MULLER, Complexity in electronic switching circuits, IRE Transactions on Electronic Computers 5, 15-19, 1956.

Crossref

Google Scholar

[57]

M. S. PATERSON, An introduction to Boolean function complexity, Astgrisque 38- 39, 183-201, 1976.

Google Scholar

[58]

M.O. I#BIN, Degree of diflieutly of computing a function and a partial ordering of reeursive sets, Teeh. Rep. No. 2, Hebrew University, 1960.

Google Scholar

[59]

M.O. tL#BIN, Mathematical theory of automata, Proceedings of 19th A CM Symposium in Applied Mathematics, 153-175, 1966.

Google Scholar

[60]

R. R#z AND A. WmD#.RSON, Monotone circuits for matching require linear depth, Proceedings of the #nd Annual A CM Symposium on Theory of Computing, 287-292, 1990.

Digital Library

Google Scholar

[61]

A. A. RAZBOROV, A lower bound on the monotone network complexity of the logical permanent, Matematicheskie gametki 37:6, 887-900 (in Russian). En/#lish translation in Mathematical Notes of the Academy of Sciences of the USSR 37:6, 485-493, 1985.

Google Scholar

[62]

A. A. RAZBOROV, A lower bound on the monotone network complexity of the logical permanent, Matema#icheskie Zametki 37:6, 887-900 (in Russian). English translation in Mathematical Notes of the Academy of Sciences of the USSR 37:6, 485--493, 1985.

Google Scholar

[63]

A.A. RAZBOROV, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41:4, 598-607 (in Russian). English translation in Mathematical Notes of the Academy of Sciences of the USSR 41:4, 333- 338, 1987.

Google Scholar

[64]

A.A. RAZBOROV, On the method of approximations, Proceedings of the 21st Annual A CM Symposium on Theory of Computing, 168-176, 1989.

Digital Library

Google Scholar

[65]

A.A. tLAZBOROV, On the distributional complexity of disjointness, Proceeding of the International Conference on Automata, Languages, and Computation, 1990; to appear in Theoretical Computer Science.

Digital Library

Google Scholar

[66]

A. A. RAZBOROV, Applications of matrix methods for the theory of lower bounds in computational complexity, Combinalorica 10, 81-93, 1990.

Crossref

Google Scholar

[67]

J.E. SAVAGE, Computational work and time on finite machines, Journal of the ACM 19:4, 660-674, 1972.

Digital Library

Google Scholar

[68]

V.Y. SAZANOV, A logical approach to the problem "P=NP?" Mathematical Foundations of Computer Science, Lecture notes in Computer Science #88, 562-575, 1980.

Digital Library

Google Scholar

[69]

H. SCHOLZ, Problem #1, Journal of Symbolic Logic, 17, 160, 1952.

Crossref

Google Scholar

[70]

A. SHAMm, IP=PSPACE, Proceedings of 2#th Annual A CM Symposium on Theory of Computing, 11-15, 1990; to appear in the Journal of the A CM.

Digital Library

Google Scholar

[71]

C.E. SHANNON, The synthesis of twoterminal switching circuits, Bell Systems Technical Journal 28:1, 59-98, 1949.

Crossref

Google Scholar

[72]

M. SIPSZR, On polynomial vs. exponential growth, unpubfished, 1981.

Google Scholar

[73]

M. SIPS#R, Borel sets and circuit complexity, Proceedings of 15th Annual A CM Symposium on Theory of Computing, 61-69, 1983.

Digital Library

Google Scholar

[74]

M. SIPSER, A topological view of some problems in complexity theory, Colloquia Mathematica Societatis Jdno8 Bolyai 44, 387-391, 1984.

Google Scholar

[75]

R. SMOLENSKY, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of lgth Annual A CM Symposium on Theory of Computing, 77-82, 1987.

Digital Library

Google Scholar

[76]

R. SZZLEPCSk.NYI, The method of forced enumeration for nondeterministic automata, Acta Informatica 26, 279-284, 1988.

Digital Library

Google Scholar

[77]

TARDOS, The gap between monotone and non-monotone circuit complexity is exponential, Combinatorica 8:1, 141-142, 1988.

Crossref

Google Scholar

[78]

B.A. TRAKHTBNBROT, A survey of Russian approaches to Perebor (brute-force search) algorithms, Annals of the History of Computing 6, no. 4, 384-400, 1984.

Digital Library

Google Scholar

[79]

G.S. TSI#ITIN, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic, Part 2, Consultants Bureau, New Youk-London, 115-125, 1962.

Google Scholar

[80]

L.G. VALIANT, Why is Boolean complexity theory difficult? Proceedings of LMS workshop on Boolean Function Complezity, Durham, edited by M. S. Paterson, Cambridge University Press, 1990.

Digital Library

Google Scholar

[81]

J. VON NEUMANN, A certain zero-sum twoperson game equivalent to the optimal assignment problem, Contributions to the Theory of Games $, 5-12, 1953.

Google Scholar

[82]

I. W}#GENER, The Complexity of Boolean Functions, Wiley-Teubner, 1987.

Digital Library

Google Scholar

[83]

S. YABLONSKI, The algorithmic difficulties of synthesizing minimal switching circuits, Prob. lemy Kibernetiki 2, Moscow, Fizmatgiz, 75- 121, 1959; translation in Problems of Cybernetics 2, Pergamon Press, 401-457, 1961.

Google Scholar

[84]

S. YABLONSKI, On the impossibility of eliminating brute force search in solving some problems of circuit theory, Doklady, AN SSSR 124, 44-47, 1959.

Google Scholar

[85]

A.C. YAO, Separating the polynomial-time hierarchy by oracles, Proceedings of 26th Annual IEEE Symposium on Foundations of Computer Science, 1-10, 1985.

Digital Library

Google Scholar

Cited By

View all

Taştan Ü(2024)TURİNG TESTİNİN SINIRLARI ÜZERİNE FELSEFİ BİR İNCELEMEFLSF Felsefe ve Sosyal Bilimler Dergisi10.53844/flsf.1437990(325-344)Online publication date: 7-May-2024
https://doi.org/10.53844/flsf.1437990
Taştan Ü(2024)Human and Machine: A View through Kant's Use of Regulative ReasonHitit İlahiyat Dergisi10.14395/hid.152279123:2(943-958)Online publication date: 30-Dec-2024
https://doi.org/10.14395/hid.1522791
Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Show More Cited By

Index Terms

The history and status of the P versus NP question
1. Theory of computation

Recommendations

On the P versus NP intersected with co-NP question in communication complexity

We consider the analog of the P versus NP@?co-NP question for the classical two-party communication protocols where polynomial time is replaced by poly-logarithmic communication: if both a boolean function f and its negation @?f have small (poly-...
P, NP, and NP-Completeness: The Basics of Computational Complexity
Sparse Sets in NP-P: EXPTIME Versus NEXPTIME

Comments

Information & Contributors

Information

Published In

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

July 1992

794 pages

ISBN:0897915119

DOI:10.1145/129712

Chairmen:
Rao Kosaraju
Johns Hopkins Univ., Baltimore, MD
,
Mike Fellows
Univ. of Victoria, Victoria, BC, Canada
,
Avi Wigderson
Hebrew University; Princeton Univ., Princeton, NJ
,
John Ellis
Univ. of Victoria, Victoria, BC, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC92

Sponsor:

SIGACT

STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992

May 4 - 6, 1992

British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
2,514
Total Downloads

Downloads (Last 12 months)310
Downloads (Last 6 weeks)34

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Taştan Ü(2024)TURİNG TESTİNİN SINIRLARI ÜZERİNE FELSEFİ BİR İNCELEMEFLSF Felsefe ve Sosyal Bilimler Dergisi10.53844/flsf.1437990(325-344)Online publication date: 7-May-2024
https://doi.org/10.53844/flsf.1437990
Taştan Ü(2024)Human and Machine: A View through Kant's Use of Regulative ReasonHitit İlahiyat Dergisi10.14395/hid.152279123:2(943-958)Online publication date: 30-Dec-2024
https://doi.org/10.14395/hid.1522791
Li W(2024)Optimizing with Attractor: A TutorialACM Computing Surveys10.1145/364835456:9(1-41)Online publication date: 15-Feb-2024
https://dl.acm.org/doi/10.1145/3648354
Shmueli O(2024)Nondeterminism and the Clique ProblemInformation and Computation10.1016/j.ic.2024.105260(105260)Online publication date: Dec-2024
https://doi.org/10.1016/j.ic.2024.105260
Lutz JLutz NMayordomo E(2023)Extending the reach of the point-to-set principleInformation and Computation10.1016/j.ic.2023.105078294(105078)Online publication date: Oct-2023
https://doi.org/10.1016/j.ic.2023.105078
Li WLi W(2023)Traveling Salesman ProblemThe Traveling Salesman Problem10.1007/978-3-031-35719-0_2(9-25)Online publication date: 9-Jul-2023
https://doi.org/10.1007/978-3-031-35719-0_2
Li WOgden CGamess E(2022)A new approach to the traveling salesman problemProceedings of the 2022 ACM Southeast Conference10.1145/3476883.3524046(52-59)Online publication date: 18-Apr-2022
https://dl.acm.org/doi/10.1145/3476883.3524046
Butler JSasao T(2022)On the Sensitivity of Boolean and Multiple-Valued Symmetric Functions2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL)10.1109/ISMVL52857.2022.00026(125-130)Online publication date: May-2022
https://doi.org/10.1109/ISMVL52857.2022.00026
Li W(2021)How to Solve the Traveling Salesman ProblemTheory of Complexity - Definitions, Models, and Applications [Working Title]10.5772/intechopen.96129Online publication date: 9-Feb-2021
https://doi.org/10.5772/intechopen.96129
Casel KFernau HKhosravian Ghadikolaei MMonnot JSikora F(2021)On the complexity of solution extension of optimization problemsTheoretical Computer Science10.1016/j.tcs.2021.10.017Online publication date: Oct-2021
https://doi.org/10.1016/j.tcs.2021.10.017
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On the P versus NP intersected with co-NP question in communication complexity

P, NP, and NP-Completeness: The Basics of Computational Complexity

Sparse Sets in NP-P: EXPTIME Versus NEXPTIME