Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: HPB-Red, Dallas, TX, U.S.A.
paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_467851076
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Paperback. Condition: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Seller Inventory # GOR009345147
Quantity: 1 available
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Condition: Very Good. 1st Edition. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Seller Inventory # 18411334-75
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 9287651-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521122542
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Seller Inventory # 6666-IUK-9780521122542
Quantity: 20 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New. 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. Seller Inventory # LU-9780521122542
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 9287651
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 216 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam. Seller Inventory # 7133783
Quantity: 4 available
Seller: Books Puddle, Woodside, NY, U.S.A.
Condition: New. Print on Demand pp. 216. Seller Inventory # 261795464