kitaycheg Posted October 2, 2012 Share Posted October 2, 2012 Download P, NP, and NP-Completeness: The Basics of Computational Complexity Book in PDF Format. Too Many Books Available in Our Site. 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 evide Link to comment Share on other sites More sharing options...
Recommended Posts