Items related to P, NP, and NP-Completeness: The Basics of Computational...
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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date2010
- ISBN 10 052119248X
- ISBN 13 9780521192484
- BindingHardcover
- Edition number1
- Number of pages216
- Rating
Buy New
Learn more about this copy
US$ 118.64
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Condition: New. Book is in NEW condition. Seller Inventory # 052119248X-2-1
Buy New
US$ 118.64
Convert currency
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Condition: New. New! This book is in the same immaculate condition as when it was published. Seller Inventory # 353-052119248X-new
Buy New
US$ 118.65
Convert currency
Seller Image
P, NP, and NP-Completeness: The Basics of Computational Complexity by Goldreich, Oded [Hardcover ]
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Hardcover. Condition: new. This item is printed on demand. Seller Inventory # 9780521192484
Buy New
US$ 118.68
Convert currency
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Feb2215580247138
Buy New
US$ 118.67
Convert currency
Stock Image
P; NP; and NP-Completeness
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780521192484_lsuk
Buy New
US$ 113.05
Convert currency
Stock Image
P, NP, and NP-Completeness
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: new. Questo è un articolo print on demand. Seller Inventory # cf698d97349bd4b13e09c43f3a416a25
Buy New
US$ 114.64
Convert currency
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: 5
Seller:
Rating
Book Description Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521192484
Buy New
US$ 129.32
Convert currency
Stock Image
P, Np, and Np-completeness: The Basics of Computational Complexity
Published by
Cambridge Univ Pr
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Hardcover. Condition: Brand New. 1st edition. 240 pages. 9.13x5.91x0.71 inches. In Stock. Seller Inventory # __052119248X
Buy New
US$ 128.09
Convert currency
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # I-9780521192484
Buy New
US$ 147.00
Convert currency
Stock Image
P, NP, and NP-Completeness: The Basics of Computational Complexity
Published by
Cambridge University Press
(2010)
ISBN 10: 052119248X
ISBN 13: 9780521192484
New
Hardcover
First Edition
Quantity: > 20
Seller:
Rating
Book Description hardcover. Condition: New. 1st Edition. Special order direct from the distributor. Seller Inventory # ING9780521192484
Buy New
US$ 151.73
Convert currency