- We will send in 10–14 business days.
/images/books/3630726/9780521192484.jpg)
- Author: Oded Goldreich
- Publisher: Cambridge University Press
- ISBN-10: 052119248X
- ISBN-13: 9780521192484
- Format: 14.7 x 22.9 x 1.8 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 23d.02:15:53
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Oded Goldreich
- Publisher: Cambridge University Press
- ISBN-10: 052119248X
- ISBN-13: 9780521192484
- Format: 14.7 x 22.9 x 1.8 cm, kieti viršeliai
- Language: English 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.
Reviews