The P=NP Question and Gödel’s Lost Letter

DOI10.1007/978-1-4419-7155-5zbMath1215.68101OpenAlexW1558846408MaRDI QIDQ3576993

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

SAT problemcomplexity theory\(\text{P}=\text{NP}\)

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) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) History of computer science (68-03)

Related Items (4)

On the limits of gate elimination ⋮ A discrete gravitational search algorithm for solving combinatorial optimization problems ⋮ On the dynamics between gravity and entanglement ⋮ Book Review: Inevitable randomness in discrete mathematics

This page was built for publication: The P=NP Question and Gödel’s Lost Letter