|
![]() |
|||
|
||||
OverviewThe 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 evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete. Full Product DetailsAuthor: Oded Goldreich (Weizmann Institute of Science, Israel)Publisher: Cambridge University Press Imprint: Cambridge University Press (Virtual Publishing) ISBN: 9780511761355ISBN 10: 051176135 Publication Date: 05 June 2012 Audience: Professional and scholarly , College/higher education , Professional & Vocational , Tertiary & Higher Education Format: Undefined Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsThe author's very intuitive account of the most fundamental issues in complexity theory makes the book suitable for a first-year computational complexity class. To the author's credit, rigor and formality are not compromised for this accessibility. In this sense, the book successfully brings the P versus NP question to a wider audience. Haris Aziz, Computing Reviews One of the pleasures of reading a book by an expert is being exposed to opinions that may not be universally accepted. Paul Cull, Computing Reviews Author InformationOded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective. Tab Content 6Author Website:Countries AvailableAll regions |