The Black Rose
Oded Goldreich
₹2,641
P, NP, and NP-Completeness
The Basics of Computational Complexity
Cambridge University Press · 2010
₹4,980
Free delivery. Nothing extra to pay at checkout.
- Delivery in 3–7 days to any serviceable pincode in India, with tracking.
- Cash on delivery. Pay when the parcel reaches you.
- 15-day returns. See what qualifies.
About this book
P, NP, and NP-Completeness: The Basics of Computational Complexity by Oded Goldreich is a 216-page book published by Cambridge University Press in 2010.
Its main subjects are Computational complexity.
Subjects
Book details
- ISBN-13
- 9780521192484
- ISBN-10
- 052119248X
- Author
- Oded Goldreich
- Publisher
- Cambridge University Press
- Published
- 2010
- Pages
- 216
- Language
- English
- Condition
- New
- Subject
- Computational complexity
More by Oded Goldreich and related titles
Foundations of Cryptography
Oded Goldreich, Oded Goldreich
₹5,267
A Primer on Pseudorandom Generators
Oded Goldreich
₹8,235
Foundations of Cryptography
Oded Goldreich
₹3,842
Computational Complexity and Property Testing
Oded Goldreich, Itai Benjamini, Scott Decatur, Maya Leshkowitz, Or Meir, Dana Ron, Guy Rothblum, Avishay Tal, Liav Teichner, Roei Tell, Avi Wigderson
₹6,622
Introduction to Property Testing
Oded Goldreich
₹7,380
Theory and Applications of Models of Computation
T.V. Gopal, Gerhard Jäger, Silvia Steila
₹4,311
Computational Complexity of Counting and Sampling
Istvan Miklos
₹6,549
Structural Complexity I
Jose L. Balcazar, Josep Diaz, Joaquim Gabarro
₹4,196
Diskrete Strukturen
Angelika Steger
₹2,050
Arithmetic, Proof Theory, and Computational Complexity
Clote, Krajicek, Peter Clote
₹4,445
Near-Rings and Near-Fields
Yuen Fong
₹4,264