02249nam a22003738a 4500 CR9780511761355 UkCbUP 20180107143412.0 m|||||o||d|||||||| cr|||||||||||| 100506s2010||||enk s ||1 0|eng|d 9780511761355 (ebook) 9780521192484 (hardback) 9780521122542 (paperback) UkCbUP UkCbUP rda QA267.7 .G652 2010 005.1 22 Goldreich, Oded, author. P, NP, and NP-Completeness : The Basics of Computational Complexity / [electronic resource] Oded Goldreich. P, NP, & NP-Completeness Cambridge : Cambridge University Press, 2010. 1 online resource (216 pages) : digital, PDF file(s). text txt rdacontent computer c rdamedia online resource cr rdacarrier Title from publisher's bibliographic system (viewed on 09 Oct 2015). The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete. Computational complexity Computer algorithms Approximation theory Polynomials Print version: 9780521192484 http://dx.doi.org/10.1017/CBO9780511761355 Cambridge Books Online 236480 236480