Skip to main content alibris logo

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

by

Write The First Customer Review
P, Np, and Np-Completeness: The Basics of Computational Complexity - Goldreich, Oded
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency
Browse related Subjects
+ Browse All Subjects

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

loading
P, Np, and Np-Completeness: The Basics of Computational Complexity 2010, Cambridge University Press, New York

ISBN-13: 9780521122542

Trade paperback

P, Np, and Np-Completeness: The Basics of Computational Complexity 2010, Cambridge University Press, New York

ISBN-13: 9780521192484

Hardcover