P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich
Material type: TextLanguage: English Publication details: New York : Cambridge University Press, c2010.Description: xxix, 184 p. : ill. ; 22+ cmISBN:- 9780521122542
- QA267.7 .G65 2010
Item type | Current library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
Books | North South University Library | Non-fiction | General Stacks | QA267.7.G65 2010 (Browse shelf(Opens below)) | 1 | Available | 35303 |
Browsing North South University Library shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
QA267.W66 1987 Theory of computation / | QA267.3.S83 2006 Languages and machines : | QA267.5.S4.M37 1997 Introduction to languages & the theory of computation / | QA267.7.G65 2010 P, NP, and NP-completeness : | QA268.L56 2004 Error control coding : | QA268.5.L44 1978 Modern switching theory and digital design / | QA269.B87 1963 Introduction to the theory of games / |
Includes bibliographical references and index.
"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"
Computer Science & Engineering
Dilruba Rahman
There are no comments on this title.