The P=NP question and Gödel's lost letter

DOI10.1007/978-1-4419-7155-5MaRDI QIDQ3576993zbMATH OpenOpenAlexFDO

Authors Richard J. Lipton

Publication date 3 August 2010

Full work available at URL https://doi.org/10.1007/978-1-4419-7155-5

zbMATH Keywords

\(\text{P}=\text{NP}\)complexity theorySAT problem

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) History of computer science (68-03) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 4098721
• Von Neumann, Gödel and complexity theory
• People, problems, and proofs. Essays from Gödel's lost letter: 2010
• scientific article; zbMATH DE number 806745
• P versus NP: the star problem of the mathematics of computation

Cited in

(11)

• On the limits of gate elimination
• On the dynamics between gravity and entanglement
• Book review of: Inevitable randomness in discrete mathematics, by József Beck
• People, problems, and proofs. Essays from Gödel's lost letter: 2010
• P versus NP: the star problem of the mathematics of computation
• Von Neumann, Gödel and complexity theory
• Algorithmic barriers falling: P = NP? A conversation with Donald E. Knuth conducted by Edgar G. Daylight on 18 June 2014 in Paris. Edited by Kurt De Grave
• scientific article; zbMATH DE number 4098721 (Why is no real title available?)
• The golden ticket. P, NP, and the search for the impossible
• A discrete gravitational search algorithm for solving combinatorial optimization problems
• scientific article; zbMATH DE number 7683979 (Why is no real title available?)

This page was built for publication: The \(\text{P}=\text{NP}\) question and Gödel's lost letter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576993)