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 Role of Business in the Responsibility to Protect by Oded Goldreich
Cover of the book The Life of Hersch Lauterpacht by Oded Goldreich
Cover of the book The Other Worlds of Hector Berlioz by Oded Goldreich
Cover of the book Natural Categories and Human Kinds by Oded Goldreich
Cover of the book How to Regulate by Oded Goldreich
Cover of the book Scaling up Machine Learning by Oded Goldreich
Cover of the book Towns, Ecology, and the Land by Oded Goldreich
Cover of the book The French War on Al Qa'ida in Africa by Oded Goldreich
Cover of the book Management across Cultures by Oded Goldreich
Cover of the book European Economic and Social Constitutionalism after the Treaty of Lisbon by Oded Goldreich
Cover of the book Civil Liability and Financial Security for Offshore Oil and Gas Activities by Oded Goldreich
Cover of the book The Cambridge Introduction to Postmodernism by Oded Goldreich
Cover of the book Fame and Failure 1720–1800 by Oded Goldreich
Cover of the book Poetry, Modernism, and an Imperfect World by Oded Goldreich
Cover of the book Schoenberg's Atonal Music 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