| 000 | 02701cam a2200397ua 4500 | ||
|---|---|---|---|
| 001 | 16271898 | ||
| 005 | 20220105002303.0 | ||
| 008 | 120703s2010 nyua b 001 0 eng | ||
| 010 | _a 2010023587 | ||
| 020 | _a0521122546 (pbk.) | ||
| 020 | _a052119248X (hardback) | ||
| 020 | _a9780521122542 (pbk.) | ||
| 020 | _a9780521192484 (hardback) | ||
| 035 | _a(OCoLC)ocn642204747 | ||
| 040 |
_aDLC _cDLC _dYDX _dCDX _dYDXCP _dDLC |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA267.7 _b.G652 2010 |
| 082 |
_222 _a005.1 |
||
| 100 | _aGoldreich, Oded. | ||
| 245 |
_aP, NP, and NP-completeness : _bthe basics of computational complexity / _cOded Goldreich. _hTextual Documents |
||
| 260 |
_aNew York : _bCambridge University Press, _c2010. |
||
| 300 |
_axxix, 184 p. : _bill. ; _c24 cm. |
||
| 504 | _aIncludes bibliographical references and index. | ||
| 505 | _aMachine 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"--Provided by publisher. | ||
| 650 | _aComputational complexity. | ||
| 650 | 0 | _aApproximation theory. | |
| 650 | 0 | _aComputer algorithms. | |
| 650 | 0 | _aPolynomials. | |
| 856 | 4 | 2 |
_3Cover image _uhttp://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg |
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 925 | 0 |
_aacquire _b2 shelf copies _xpolicy default |
|
| 942 | _cBK | ||
| 955 |
_dxh09 2010-06-15 to Dewey _frc09 2010-11-29 Z-CipVer _trc09 2010-11-29 c. 2 added _wrd14 2010-06-15 |
||
| 999 |
_c301205 _d301205 |
||