Hüppa põhisisu juurde
Raamatukoi
Tõde ja õigus

P, NP, and NP-Completeness

The Basics of Computational Complexity

Oded Goldreich · Cambridge University Press · 2010

P, NP, and NP-Completeness

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.

Saadavus
184,00 €

Uus kasutamata raamat

Täna tellides on tarneaeg umbes 10 päeva (27.11.2026)Tellimuse täitmise aeg on umbkaudne ja sõltub nädalapäevast, millal tellimus tehakse. Reeglina ei kulu üle kahe nädala.

Tarne ja kättesaamine

Detailid

Alapealkiri
The Basics of Computational Complexity
ISBN
9780521192484
Aasta
2010
Keel
inglise
Köide
Kõva kaas
Lehekülgi
216
Teema
Arvutid ja infotehnoloogia › Arvutiteadus — Computer science
Kaal
462 g