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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Goldreich, Oded
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, ©2010.
Temas:
Computational complexity.
Computer algorithms.
Approximation theory.
Polynomials.
Algorithms
Complexité de calcul (Informatique)
Algorithmes.
Théorie de l'approximation.
Polynômes.
algorithms.
COMPUTERS > Programming > Open Source.
COMPUTERS > Software Development & Engineering > Tools.
COMPUTERS > Software Development & Engineering > General.
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Computational tasks and models
  • The P versus NP question
  • Polynomial-time reductions
  • NP-completeness
  • Three relatively advanced topics
  • Epilogue: a brief overview of complexity theory.

Ejemplares similares