-66% OFFP, NP, and NP-Completeness (English, Oded Goldreich)
Inclusive of all applicable taxes. Free shipping on orders above ₹499, else ₹49 flat.
Available Offers
- 🚚Free Delivery — Free on orders above ₹499, else ₹49 flat
- 💵Cash on Delivery — Pay when your order arrives
- ↩️15-Day Easy Returns — Hassle-free return policy
- 🔒Cash on Delivery — Pay safely when your order arrives
Check Delivery
Specifications
| Publisher | Cambridge University Press |
| Language | English |
| ISBN-13 | 9780521192484 |
| ISBN-10 | 052119248X |
| Author | Oded Goldreich |
Product Description
Here on GlowMirror, you'll find P, NP, and NP-Completeness filed under Cambridge University Press -- everything you need to know is covered below.
About the Book
The focus of this book is the P-versus-NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P-versus-NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer…
ISBN: 9780521192484
Book Insights
What You'll Learn
- ·In-depth exploration of topics covered in P, NP, and NP-Completeness
- ·Key concepts explained with clarity and practical examples
- ·Insights valuable for anyone studying or working in Cambridge University Press
Who Should Read This
Students and professionals interested in Cambridge University Press, as well as general readers looking to expand their knowledge.
Key Highlights
- ·Brand new physical book delivered across India
- ·15-day hassle-free return policy





