P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.

Goldreich, Oded
Call Number
005.1
Author
Goldreich, Oded, author.
Title
P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich.
P, NP, & NP-Completeness
Physical Description
1 online resource (xxix, 184 pages) : digital, PDF file(s).
Notes
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents
Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.
Summary
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.
Subject
COMPUTATIONAL COMPLEXITY.
COMPUTER ALGORITHMS.
APPROXIMATION THEORY.
POLYNOMIALS.
Multimedia
Total Ratings: 0
No records found to display.
 
 
 
02543nam a22004098i 4500
001
 
 
vtls001584808
003
 
 
VRT
005
 
 
20200921122100.0
006
 
 
m|||||o||d||||||||
007
 
 
cr||||||||||||
008
 
 
200921s2010||||enk     o     ||1 0|eng|d
020
$a 9780511761355 (ebook)
020
$z 9780521192484 (hardback)
020
$z 9780521122542 (paperback)
035
$a (UkCbUP)CR9780511761355
039
9
$y 202009211221 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA267.7 $b .G652 2010
082
0
0
$a 005.1 $2 22
100
1
$a Goldreich, Oded, $e author.
245
1
0
$a P, NP, and NP-completeness : $b the basics of computational complexity / $c Oded Goldreich.
246
3
$a P, NP, & NP-Completeness
264
1
$a Cambridge : $b Cambridge University Press, $c 2010.
300
$a 1 online resource (xxix, 184 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505
8
$a Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.
520
$a 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.
650
0
$a COMPUTATIONAL COMPLEXITY.
650
0
$a COMPUTER ALGORITHMS.
650
0
$a APPROXIMATION THEORY.
650
0
$a POLYNOMIALS.
776
0
8
$i Print version: $z 9780521192484
856
4
0
$u https://doi.org/10.1017/CBO9780511761355
999
$a VIRTUA               
No Reviews to Display
Summary
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.
Notes
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents
Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.
Subject
COMPUTATIONAL COMPLEXITY.
COMPUTER ALGORITHMS.
APPROXIMATION THEORY.
POLYNOMIALS.
Multimedia