TY  - BOOK
AU  - Goldreich,Oded
TI  - P, NP, and NP-completeness: the basics of computational complexity 
SN  - 9780511909443
AV  - QA267.7 .G652 2010eb
U1  - 005.1 22
PY  - 2010///
CY  - Cambridge, New York
PB  - Cambridge University Press
KW  - Computational complexity
KW  - Computer algorithms
KW  - Approximation theory
KW  - Polynomials
KW  - Algorithms
KW  - Complexité de calcul (Informatique)
KW  - Algorithmes
KW  - Théorie de l'approximation
KW  - Polynômes
KW  - algorithms
KW  - aat
KW  - COMPUTERS
KW  - Programming
KW  - Open Source
KW  - bisacsh
KW  - Software Development & Engineering
KW  - Tools
KW  - General
KW  - fast
KW  - Electronic books
N1  - Includes bibliographical references (pages 181-182) and index; Computational tasks and models -- The P versus NP question -- Polynomial-time reductions -- NP-completeness -- Three relatively advanced topics -- Epilogue: a brief overview of complexity theory
N2  - "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"--
UR  - https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=335200
ER  -