Skip to main content
PBS logo
 
 

Search - P, NP, and NP-Completeness: The Basics of Computational Complexity

P, NP, and NP-Completeness: The Basics of Computational Complexity
P NP and NPCompleteness The Basics of Computational Complexity
Author: Oded Goldreich
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 no...  more »
ISBN-13: 9780521122542
ISBN-10: 0521122546
Publication Date: 8/16/2010
Pages: 216
Edition: 1
Rating:
  ?
0 stars, based on 0 rating
Publisher: Cambridge University Press
Book Type: Paperback
Other Versions: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review



Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.