Skip to content

P, NP, and NP-Completeness by Goldreich, Oded (Weizmann Institute of Science, Israel)

by Goldreich, Oded (Weizmann Institute of Science, Israel)

Similar copies are shown below.
Similar copies are shown to the right.
P, NP, and NP-Completeness by Goldreich, Oded (Weizmann Institute of Science, Israel)
Stock Photo: Cover May Be Different

P, NP, and NP-Completeness

by Goldreich, Oded (Weizmann Institute of Science, Israel)

  • New
  • Paperback
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,

We have 7 copies available starting at A$78.17.

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 10 / ISBN 13
9780521122542 / 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
A$78.17
A$7.99 shipping to

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
A$78.17
A$7.99 shipping to
P, NP, and NP-Completeness
Stock Photo: Cover May Be Different

P, NP, and NP-Completeness

by Oded Goldreich

  • New
Condition
New
ISBN 10 / ISBN 13
9780521122542 / 0521122546
Quantity Available
4
Seller
Woodside, New York, United States
Seller rating:
This seller has earned a 5 of 5 Stars rating from Biblio customers.
Item Price
A$89.63
A$3.99 shipping to

Show Details

Description:
Cambridge University Press CUP , pp. 216 . Papeback. New.
Item Price
A$89.63
A$3.99 shipping to
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 10 / ISBN 13
9780521122542 / 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
A$75.01
A$10.00 shipping to

Show Details

Description:
Cambridge Univ Pr, 2010. Paperback. New. 1st edition. 240 pages. 9.06x5.98x0.55 inches.
Item Price
A$75.01
A$10.00 shipping to
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 10 / ISBN 13
9780521122542 / 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
A$81.79
A$10.00 shipping to

Show Details

Description:
Cambridge Univ Pr, 2010. Paperback. New. 1st edition. 240 pages. 9.06x5.98x0.55 inches.
Item Price
A$81.79
A$10.00 shipping to
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 10 / ISBN 13
9780521122542 / 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
A$85.78
A$9.95 shipping to

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
A$85.78
A$9.95 shipping to
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 10 / ISBN 13
9780521122542 / 0521122546
Quantity Available
5
Seller
campbelltown, Florida, United States
Seller rating:
This seller has earned a 2 of 5 Stars rating from Biblio customers.
Item Price
A$90.99
A$75.00 shipping to

Show Details

Description:
Cambridge University Press, 2010-08-15. paperback. New. 6x0x9. Brand New Book in Publishers original Sealing
Item Price
A$90.99
A$75.00 shipping to
P, NP, and NP-Completeness
Stock Photo: Cover May Be Different

P, NP, and NP-Completeness

by Oded Goldreich

  • New
  • Paperback
  • first
Condition
New
Binding
Paperback
ISBN 10 / ISBN 13
9780521122542 / 0521122546
Quantity Available
1
Seller
Antwerpen, Belgium
Seller rating:
This seller has earned a 1 of 5 Stars rating from Biblio customers.
Item Price
A$233.75
A$72.50 shipping to

Show Details

Description:
Cambridge University Press, 2010. Paperback. New. First Edition thus, as good as new. P, NP, and NP-Completeness by Oded Goldreich. Published by Cambridge University Press in 2010. Paperback ISBN:9780521122542. Collectible item in excellent condition.
Item Price
A$233.75
A$72.50 shipping to