000 02249nam a22003738a 4500
001 CR9780511761355
003 UkCbUP
005 20180107143412.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 100506s2010||||enk s ||1 0|eng|d
020 _a9780511761355 (ebook)
020 _z9780521192484 (hardback)
020 _z9780521122542 (paperback)
040 _aUkCbUP
_cUkCbUP
_erda
050 0 0 _aQA267.7
_b.G652 2010
082 0 0 _a005.1
_222
100 1 _aGoldreich, Oded,
_eauthor.
245 1 0 _aP, NP, and NP-Completeness :
_bThe Basics of Computational Complexity / [electronic resource]
_cOded Goldreich.
246 3 _aP, NP, & NP-Completeness
264 1 _aCambridge :
_bCambridge University Press,
_c2010.
300 _a1 online resource (216 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 09 Oct 2015).
520 _aThe 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 _aComputational complexity
650 0 _aComputer algorithms
650 0 _aApproximation theory
650 0 _aPolynomials
776 0 8 _iPrint version:
_z9780521192484
856 4 0 _uhttp://dx.doi.org/10.1017/CBO9780511761355
_zCambridge Books Online
999 _c236480
_d236480