Skip to content

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

Best in textbook rentals since 2012!

ISBN-10: 052119248X

ISBN-13: 9780521192484

Edition: 2010

Authors: Oded Goldreich

List price: $136.95
Blue ribbon 30 day, 100% satisfaction guarantee!
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Customers also bought

Book details

List price: $136.95
Copyright year: 2010
Publisher: Cambridge University Press
Publication date: 8/16/2010
Binding: Hardcover
Pages: 216
Size: 5.79" wide x 9.02" long x 0.71" tall
Weight: 1.078
Language: English

Computational tasks and models
The P versus NP Question
Polynomial-time reductions
NP-completeness
Three relatively advanced topics
Epilogue: a brief overview of complexity theory