The P=NP question and Gödel's lost letter
DOI10.1007/978-1-4419-7155-5zbMATH Open1215.68101OpenAlexW1558846408MaRDI QIDQ3576993FDOQ3576993
Authors: Richard J. Lipton 
Publication date: 3 August 2010
Full work available at URL: https://doi.org/10.1007/978-1-4419-7155-5
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (11)
- The golden ticket. P, NP, and the search for the impossible
- P versus NP: the star problem of the mathematics of computation
- On the limits of gate elimination
- On the dynamics between gravity and entanglement
- 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
- Book review of: Inevitable randomness in discrete mathematics, by József Beck
- Title not available (Why is that?)
- Von Neumann, Gödel and complexity theory
- People, problems, and proofs. Essays from Gödel's lost letter: 2010
- Title not available (Why is that?)
- A discrete gravitational search algorithm for solving combinatorial optimization problems
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)
