P, NP, and NP-completeness : the basics of computational complexity /
"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 sol...
Guardado en:
| Autor Principal: | |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
New York :
Cambridge University Press,
2010.
|
| Materias: | |
| Acceso en línea: | Cover image |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 02255cam a22003134a 4500 | ||
|---|---|---|---|
| 001 | DCC.dcic001627 | ||
| 008 | 100608s2010####nyua#####b####001#0#eng## | ||
| 005 | 20151124125617.0 | ||
| 245 | 1 | 0 | |a P, NP, and NP-completeness : |b the basics of computational complexity / |c Oded Goldreich. |
| 260 | |a New York : |b Cambridge University Press, |c 2010. | ||
| 300 | |a xxix, 184 p. : |b il. ; |c 24 cm. | ||
| 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. | ||
| 504 | |a Incluye referencias bibliográficas e índice. | ||
| 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. | |
| 020 | |a 9780521192484 (hardback) | ||
| 020 | |a 052119248X (hardback) | ||
| 020 | |a 9780521122542 (pbk.) | ||
| 020 | |a 0521122546 (pbk.) | ||
| 100 | 1 | |a Goldreich, Oded. | |
| 082 | 0 | 0 | |a 005.1 |2 22 |
| 650 | 0 | |a Computational complexity. | |
| 650 | 0 | |a Computer algorithms. | |
| 650 | 0 | |a Approximation theory. | |
| 650 | 0 | |a Polynomials. | |
| 010 | |a 2010023587 | ||
| 040 | |a DLC |c DLC |d YDX |d CDX |d YDXCP |d DLC | ||
| 050 | 0 | 0 | |a QA267.7 |b .G652 2010 |
| 856 | 4 | 2 | |3 Cover image |u http://assets.cambridge.org/97805211/92484/cover/9780521192484.jpg |
| 859 | |a DCIC |b BIB. COMPUTACION |p 2226 | ||