P, NP and NP - Completeness : The Basics of Computational Complexity / by Oded Goldreich. [Electronic Resource]
Material type: Computer filePublication details: Cambridge : Cambridge University Press, 2010Description: xxix, 184pISBN:- 9780511761355
- 005.1Â G563P
Item type | Home library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|---|
e-Book | S. R. Ranganathan Learning Hub Online | Textbook | 005.1 G563P (Browse shelf(Opens below)) | Available (e-Book For Access) | Platform : Cambridge Core | EB0393 |
Browsing S. R. Ranganathan Learning Hub shelves, Shelving location: Online, Collection: Textbook Close shelf browser (Hides shelf browser)
004.6 D788E Epidemics and Rumours in Complex Networks | 004.65 P442C Computer Networks : A Systems Approach | 005.1 B737A Advanced Data Structures | 005.1 G563P P, NP and NP - Completeness : The Basics of Computational Complexity | 005.1 Se55D Design and Analysis of Algorithms : A Contemporary Perspective | 005.1 So55S Software Engineering | 005.117 L978L Learning Python : Powerful Object-Oriented Programming. |
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.
There are no comments on this title.