Items related to P, Np, and Np-Completeness: The Basics of Computational...
Synopsis
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.
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.
"About this title" may belong to another edition of this title.
Search results for P, Np, and Np-Completeness: The Basics of Computational...
Stock Image
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press (edition 1), 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
Paperback
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Seller Inventory # 0521122546-11-1
Stock Image
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
Softcover
Seller: Wonder Book, Frederick, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. Very Good condition. A copy that may have a few cosmetic defects. May also contain light spine creasing or a few markings such as an owner's name, short gifter's inscription or light stamp. Seller Inventory # P07R-00414
Stock Image
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
paperback
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
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
Stock Image
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
Softcover
First Edition
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
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
Buy Used
£ 33.13
£ 5 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
Paperback
Seller: WorldofBooks, Goring-By-Sea, WS, United Kingdom
Seller rating 5 out of 5 stars
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
Buy Used
£ 35.94
£ 5.60 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press 2010-10, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
New
PF
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
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
Buy New
£ 46.62
£ 4.99 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 20 available
Seller Image
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
New
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 9287651-n
Stock Image
P, Np, and Np-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521122542
Seller Image
P, NP, and NP-Completeness
Published by
Cambridge University Press, GB, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
New
Paperback
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
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
Buy New
£ 54.40
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
P, NP, and NP-Completeness : The Basics of Computational Complexity
Published by
Cambridge University Press, 2010
ISBN 10: 0521122546
ISBN 13: 9780521122542
Used
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 9287651