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 Colonial Caribbean by Oded Goldreich
Cover of the book The International Dimension of EU Competition Law and Policy by Oded Goldreich
Cover of the book Shadows of War by Oded Goldreich
Cover of the book Planning Clinical Research by Oded Goldreich
Cover of the book The Cambridge Companion to Plato's Republic by Oded Goldreich
Cover of the book Christianity and Human Rights by Oded Goldreich
Cover of the book The Cambridge Handbook of Situated Cognition by Oded Goldreich
Cover of the book The Self-Potential Method by Oded Goldreich
Cover of the book Myth, Literature, and the Creation of the Topography of Thebes by Oded Goldreich
Cover of the book Female Friends and the Making of Transatlantic Quakerism, 1650–1750 by Oded Goldreich
Cover of the book The Hard Slog by Oded Goldreich
Cover of the book Mobile Wireless Communications by Oded Goldreich
Cover of the book Goethe's Faust by Oded Goldreich
Cover of the book Spinoza and German Idealism by Oded Goldreich
Cover of the book Introductory Econometrics for Finance 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