All categories
caret-down
cartcart

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

 
Only 1 items left in stock
P, Np, and Np-Completeness: The Basics of Computational Complexity

Description

Starting from the basics of computability, this undergraduate introduction focuses on the P versus NP Question and the theory of NP-completeness.

Product details

EAN/ISBN:
9780521122542
Edition:
Illustrated
Format:
Illustriert
Medium:
Paperback
Number of pages:
214
Publication date:
2010-10-21
Publisher:
Cambridge University Press
Manufacturer:
Unknown
EAN/ISBN:
9780521122542
Edition:
Illustrated
Format:
Illustriert
Medium:
Paperback
Number of pages:
214
Publication date:
2010-10-21
Publisher:
Cambridge University Press
Manufacturer:
Unknown

Shipping

laposte
The edition supplied may vary.
Condition
Condition
Learn more
€39.49
available immediately
New €48.80 You save €9.31 (19%)
€39.49
incl. VAT, plus  Shipping costs
paypalvisamastercardamexcartebleue
  • Icon badgeChecked second-hand items
  • Icon packageFree shipping from €19
  • Icon vanWith you in 2-4 working days