P, NP, and NP-Completeness

The Basics of Computational Complexity

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, General Computing, Programming
Cover of the book P, NP, and NP-Completeness by Oded Goldreich, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Oded Goldreich ISBN: 9781139929776
Publisher: Cambridge University Press Publication: August 16, 2010
Imprint: Cambridge University Press Language: English
Author: Oded Goldreich
ISBN: 9781139929776
Publisher: Cambridge University Press
Publication: August 16, 2010
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book The Constructive Mind by Oded Goldreich
Cover of the book The Borders of Race in Colonial South Africa by Oded Goldreich
Cover of the book The Linguistics of British Sign Language by Oded Goldreich
Cover of the book Brain-Computer Interfacing by Oded Goldreich
Cover of the book Slavery and Forced Migration in the Antebellum South by Oded Goldreich
Cover of the book War and Change in World Politics by Oded Goldreich
Cover of the book Handbook of International Law by Oded Goldreich
Cover of the book Contemporary Challenges to the Laws of War by Oded Goldreich
Cover of the book A Student's Guide to Infinite Series and Sequences by Oded Goldreich
Cover of the book Convex Optimization of Power Systems by Oded Goldreich
Cover of the book Greek and Roman Aesthetics by Oded Goldreich
Cover of the book Physical Principles of Remote Sensing by Oded Goldreich
Cover of the book Introductory Quantum Optics by Oded Goldreich
Cover of the book Holographic Duality in Condensed Matter Physics by Oded Goldreich
Cover of the book Waves and Mean Flows by Oded Goldreich
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy