BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

P, NP, and NP-Completeness
Stock photo: cover may vary

P, NP, and NP-Completeness Hardback - 2010 - 1st Edition

by Oded Goldreich

Add to wish list

Reader reviews for P, NP, and NP-Completeness

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

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.

Details

  • Title P, NP, and NP-Completeness
  • Author Oded Goldreich
  • Binding Hardback
  • Edition number 1st
  • Edition 1
  • Pages 216
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2010-08-16
  • Features Bibliography
  • ISBN 9780521192484 / 052119248X
  • Weight 0.9 lbs (0.41 kg)
  • Dimensions 9 x 5.8 x 0.7 in (22.86 x 14.73 x 1.78 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - General Information
  • Library of Congress Catalogue Number 2010023587
  • Dewey Decimal Code 005.1

Media reviews

Citations

  • Choice, 02/01/2011, Page 0
Back to top↑

More Copies for Sale

P, NP, and NP-Completeness: The Basics of Computational Complexity

P, NP, and NP-Completeness: The Basics of Computational Complexity

by Oded Goldreich

  • New
  • Hardback
Condition
New
Binding
Hardcover
ISBN 10 / ISBN 13
9780521192484 / 052119248x
Quantity available
10
Seller
The Saint Bookstore
Biblio Top Seller
Item price
A$240.83
A$19.03 Delivery to USA

Show details

Description:
Hardback. New. This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It 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.
Add to wish list
Item price
A$240.83
A$19.03 Delivery to USA
P, NP, and NP-Completeness

P, NP, and NP-Completeness

by Oded Goldreich

  • New
  • Hardback
Condition
New
Binding
Hardcover
ISBN 10 / ISBN 13
9780521192484 / 052119248x
Quantity available
535
Seller
Ria Christie Collections
Item price
A$246.83
A$15.28 Delivery to USA

Show details

Description:
Hardcover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; This undergraduate introduction to computational complexity gives a wide perspective on two central issues in theoretical computer science. It starts with the relevant background in computability, including Turing machines, search and d
Add to wish list
Item price
A$246.83
A$15.28 Delivery to USA
P, Np, and Np-completeness: The Basics of Computational Complexity
Stock photo: cover may vary

P, Np, and Np-completeness: The Basics of Computational Complexity

by Goldreich, Oded

  • New
  • Hardback
Condition
New
Binding
Hardcover
ISBN 10 / ISBN 13
9780521192484 / 052119248X
Quantity available
2
Seller
Revaluation Books
Item price
A$323.93
A$47.82 Delivery to USA

Show details

Description:
Cambridge Univ Pr, 2010. Hardcover. New. 1st edition. 240 pages. 9.13x5.91x0.71 inches.
Add to wish list
Item price
A$323.93
A$47.82 Delivery to USA
P, NP, and NP-Completeness: The Basics of Computational Complexity
Stock photo: cover may vary

P, NP, and NP-Completeness: The Basics of Computational Complexity

by Goldreich, Oded

  • New
  • Hardback
  • first
Condition
New
Edition
1
Binding
Hardcover
ISBN 10 / ISBN 13
9780521192484 / 052119248X
Quantity available
6
Seller
Ergodebooks
Item price
A$244.32
Free Delivery to USA

Show details

Description:
Cambridge University Press, 2010-08-16. 1. hardcover. New. 6.00x0.75x9.00. Buy with confidence. Excellent Customer Service & Return policy.
Add to wish list
Item price
A$244.32
Free Delivery to USA
P, Np, and Np-Completeness
Stock photo: cover may vary

P, Np, and Np-Completeness

by Oded, Goldreich,

  • New
Condition
New
ISBN 10 / ISBN 13
9780521192484 / 052119248x
Quantity available
1
Seller
GreatBookPrices
Item price
A$246.30
A$5.71 Delivery to USA

Show details

Description:
new.
Add to wish list
Item price
A$246.30
A$5.71 Delivery to USA
P, NP, and NP-Completeness
Stock photo: cover may vary

P, NP, and NP-Completeness

by Oded Goldreich

  • New
  • Hardback
Condition
New
Binding
Hardcover
ISBN 10 / ISBN 13
9780521192484 / 052119248X
Quantity available
4
Seller
Cold Books
Item price
A$330.83
A$5.71 Delivery to USA

Show details

Description:
Cambridge University Press CUP , pp. 216 1st Edition . Hardback. New.
Add to wish list
Item price
A$330.83
A$5.71 Delivery to USA
P, Np, and Np-Completeness
Stock photo: cover may vary

P, Np, and Np-Completeness

by Oded, Goldreich,

  • Used
Condition
New
ISBN 10 / ISBN 13
9780521192484 / 052119248x
Quantity available
1
Seller
GreatBookPrices
Item price
A$380.17
A$5.71 Delivery to USA

Show details

Description:
like new.
Add to wish list
Item price
A$380.17
A$5.71 Delivery to USA
Show all copies
Back to top↑

Please wait a moment while we load the requested page.