Picture 1 of 1

Stock photo
Stock photo
P, NP, and NP-Completeness: The Basics of Computational Complexity by Oded Goldr - Picture 1 of 1

P, NP, and NP-Completeness: The Basics of Computational Complexity by Oded Goldreich (Hardcover, 2010)

Be the first towrite a review.
  • thenilestore (1211458)
  • 98.2% positive Feedback
Price:
AU $177.10
Free postage
Estimated delivery Thu, 23 May - Wed, 29 May
Returns:
30-day returns. Buyer pays for return postage.
Condition:
Brand new
By Oded Goldreich. Author Oded Goldreich. It also provides adequate preliminaries regarding computational problems and computational models. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness.