P, NP, and NP-completeness : the basics of computational complexity / Oded Goldreich
Tipo de material:
TextoDetalles de publicación: New York : Cambridge University Press, 2010 Descripción: XXIX, 184 p.; 24ISBN: 9780521122542Tema(s): Complejidad computacional | Algoritmos computacionales | Aproximación, Teoría de | PolinomiosResumen: 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.
| Tipo de ítem | Biblioteca de origen | Signatura | URL | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | Bibliografía recomendada |
|---|---|---|---|---|---|---|---|---|
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 519.6/GOL/pnp (Navegar estantería(Abre debajo)) | Disponible Ubicación en estantería | Bibliomaps® | 3744371450 | ||||
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 519.6/GOL/pnp (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 374427779X | |||
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 519.6/GOL/pnp (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3744181074 |
COMPLEJIDAD COMPUTACIONAL GRADO EN INGENIERÍA INFORMÁTICA Asignatura actualizada 2023-2024 |
||
| Manuales | 03. BIBLIOTECA INGENIERÍA PUERTO REAL | 519.6/GOL/pnp (Navegar estantería(Abre debajo)) | Texto completo | Disponible Ubicación en estantería | Bibliomaps® | 3744178807 |
Indice
Bibliografí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.
No hay comentarios en este titulo.