We specialize in hard to find items
All Categories
P, Np, and Np-Completeness: The Basics of Computational Complexity
Share Tweet
*Price and Stocks may change without prior notice
*Packaging of actual item may differ from photo shown
- Electrical items MAY be 110 volts.
- 7 Day Return Policy
- All products are genuine and original
About P, Np, And Np-Completeness: The Basics Of
Product Description 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 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. Review "The 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 "The author is a well-known expert in the field of complexity theory and so is well-qualified to bring out this book which will serve as a very good introductory textbook. The focus on search problems and promise problems in this book is to be appreciated since many books neglect these topics." S.V. Naaraj, SIGACT News Book Description This undergraduate introduction to computational complexity offers a wide perspective on two central issues in theoretical computer science. The book starts with the relevant background in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, and then focuses on the P-versus-NP Question and the theory of NP-completeness. About the Author Oded 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.
