P, NP, and NP-Completeness: The Basics of Computational Complexity - Rilegato

Goldreich, Oded

Rilegato

ISBN 10: 052119248X ISBN 13: 9780521192484

Casa editrice: Cambridge University Press, 2010

Riassunto

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.

Su questo libro

Recensione:

'The author is a well-known expert in the field of complexity theory and so is well-qualified to bring out this book which will serve as a very good introductory textbook. The focus on search problems and promise problems in this book is to be appreciated since many books neglect these topics.' S. V. Naaraj, SIGACT News

Descrizione del libro:

This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P versus NP Question and the theory of NP-completeness.

Su questa edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2010
• ISBN 10: 052119248X
• ISBN 13: 9780521192484
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 216