All categories
caret-down
cartcart

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

 
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
EAN/ISBN:
9780521122542
Edition:
Illustrated
Format:
Illustriert
Medium:
Paperback
Number of pages:
214
Publication date:
2010-10-21
Publisher:
Cambridge University Press

Shipping

laposte
The edition supplied may vary.
Currently sold out