Skip to content

P, Np, and Np-Completeness: The Basics of Computational Complexity
Stock Photo: Cover May Be Different

P, Np, and Np-Completeness: The Basics of Computational Complexity Paperback - 2010

by Oded Goldreich


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: The Basics of Computational Complexity
  • Author Oded Goldreich
  • Binding Paperback
  • Pages 216
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Date 2010-08-16
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents, Textbook
  • ISBN 9780521122542 / 0521122546
  • Weight 0.65 lbs (0.29 kg)
  • Dimensions 8.9 x 5.9 x 0.6 in (22.61 x 14.99 x 1.52 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Library of Congress Catalog Number 2010023587
  • Dewey Decimal Code 005.1

Media reviews

Citations

  • Choice, 02/01/2011, Page 0
  • Scitech Book News, 12/01/2010, Page 31
Back to Top

More Copies for Sale

P, Np, and Np-completeness: The Basics of Computational Complexity
Stock Photo: Cover May Be Different

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

by Goldreich, Oded

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 13
9780521122542
ISBN 10
0521122546
Quantity Available
1
Seller
Exeter, Devon, United Kingdom
Seller rating:
This seller has earned a 4 of 5 Stars rating from Biblio customers.
Item Price
$49.23
$12.77 shipping to USA

Show Details

Description:
Cambridge Univ Pr, 2010. Paperback. New. 1st edition. 240 pages. 9.06x5.98x0.55 inches.
Item Price
$49.23
$12.77 shipping to USA
P, NP, and NP-Completeness: The Basics of Computational Complexity

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

by Oded Goldreich

  • New
Condition
New
ISBN 13
9780521122542
ISBN 10
0521122546
Quantity Available
549
Seller
Uxbridge, Greater London, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$51.30
$10.20 shipping to USA

Show Details

Description:
New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The P, NP, and NP-Completeness: The Basics of Computational Complexity.
Item Price
$51.30
$10.20 shipping to USA
P, Np, and Np-completeness: The Basics of Computational Complexity
Stock Photo: Cover May Be Different

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

by Goldreich, Oded

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 13
9780521122542
ISBN 10
0521122546
Quantity Available
2
Seller
Exeter, Devon, United Kingdom
Seller rating:
This seller has earned a 4 of 5 Stars rating from Biblio customers.
Item Price
$52.37
$12.77 shipping to USA

Show Details

Description:
Cambridge Univ Pr, 2010. Paperback. New. 1st edition. 240 pages. 9.06x5.98x0.55 inches.
Item Price
$52.37
$12.77 shipping to USA
P, NP, and NP-Completeness: The Basics of Computational Complexity

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

by Oded Goldreich

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 13
9780521122542
ISBN 10
0521122546
Quantity Available
10
Seller
Southport, Merseyside, United Kingdom
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$56.29
$12.71 shipping to USA

Show Details

Description:
Paperback / softback. 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.
Item Price
$56.29
$12.71 shipping to USA
P, NP, and NP-Completeness: The Basics of Computational Complexity
Stock Photo: Cover May Be Different

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

by Goldreich, Oded

  • New
  • Paperback
Condition
New
Binding
Paperback
ISBN 13
9780521122542
ISBN 10
0521122546
Quantity Available
5
Seller
campbelltown, Florida, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
$58.00
$15.00 shipping to USA

Show Details

Description:
Cambridge University Press, 2010-08-15. paperback. New. 6x0x9. Brand New Book in Publishers original Sealing
Item Price
$58.00
$15.00 shipping to USA