P, NP, and NP-completeness :The basics of computational complexity

other_versions_link

"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ó completa

Dades bibliogràfiques
Autor principal: Goldreich, Oded
Format: Printed Book
Publicat: New York : Cambridge University Press, 2010.
Matèries:
Computational complexity.
Computer algorithms.
Approximation theory.
Polynomials. > Computer science
Search Result 1
P, NP and NP - completeness - the basics of computational complexity/
per Goldreich, Oded
Publicat 2010
Printed Book
Search Result 2
P, NP and NP Completeness the basics of computational complexity
per Goldreich, Oded
Publicat 2010
Printed Book
Search Result 3
P, NP, and NP-completeness : the basics of computational complexity /
per Goldreich, Oded
Publicat 2010
Cover image
Printed Book
other_versions_search_link

Ítems similars