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

Full description

Bibliographic Details
Main Author: Goldreich, Oded
Format: Printed Book
Published: New York : Cambridge University Press, 2010.
Subjects:
Computational complexity.
Computer algorithms.
Approximation theory.
Polynomials. > Computer science

Kannur University

Holdings details from Kannur University
Call Number: 005.1 GOL/P
Copy Stack Live Status Unavailable

Similar Items