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: | Goldreich, Oded. |
|---|---|
| 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!
|
Ejemplares similares
-
Approximation algorithms for NP-hard problems /
Publicado: (1997) -
Computational complexity : a conceptual perspective /
por: Goldreich, Oded.
Publicado: (2008) -
Introduction to the theory of computation /
por: Sipser, Michael.
Publicado: (1997) -
Computational complexity /
por: Papadimitriou, Christos H.
Publicado: (1994) -
Degree of approximation by polynomials in the complex domain /
por: Sewell, W. E.
Publicado: (1942)
