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.*

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.

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.*

US$ 38.52

**Shipping:**
FREE

From United Kingdom to U.S.A.

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2010. Paperback. Book Condition: New. Language: English . Brand New Book. 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. Bookseller Inventory # AAZ9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Paperback
Quantity Available: 1

Seller:

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2010. Paperback. Book Condition: New. Language: English . Brand New Book. 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. Bookseller Inventory # AAZ9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press, 2010. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9780521122542

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Quantity Available: 1

Seller:

Rating

**Book Description **Book Condition: New. Bookseller Inventory # ST0521122546. Bookseller Inventory # ST0521122546

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press 2010-08-16, Cambridge
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press 2010-08-16, Cambridge, 2010. paperback. Book Condition: New. Bookseller Inventory # 9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Quantity Available: 1

Seller:

Rating

**Book Description **Cambridge University Press, 2010. PAP. Book Condition: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Bookseller Inventory # GB-9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press 8/1/2010
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Paperback or Softback
Quantity Available: 10

Seller:

Rating

**Book Description **Cambridge University Press 8/1/2010, 2010. Paperback or Softback. Book Condition: New. P, NP, and NP-Completeness: The Basics of Computational Complexity. Book. Bookseller Inventory # BBS-9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2017)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Paperback
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press, 2017. Paperback. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # 0521122546

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Softcover
First Edition
Quantity Available: 1

Seller:

Rating

**Book Description **Cambridge University Press, 2010. Book Condition: New. 2010. 1st Edition. Paperback. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Num Pages: 216 pages, 18 b/w illus. 94 exercises. BIC Classification: UYA. Category: (UU) Undergraduate. Dimension: 228 x 156 x 13. Weight in Grams: 336. The Basics of Computational Complexity. 214 pages, 18 b/w illus. 94 exercises. Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness. Cateogry: (UU) Undergraduate. BIC Classification: UYA. Dimension: 228 x 156 x 13. Weight: 330. . . . . . . Bookseller Inventory # V9780521122542

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2010)

ISBN 10: 0521122546
ISBN 13: 9780521122542

New
Quantity Available: > 20

Seller:

Rating

**Book Description **Cambridge University Press, 2010. PAP. Book Condition: New. New Book. Delivered from our UK warehouse in 3 to 5 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IQ-9780521122542

More Information About This Seller | Ask Bookseller a Question