P, NP, and NP-completeness : the basics of computational complexity [E-Book] / Oded Goldreich.
Goldreich, Oded, (author)
Cambridge : Cambridge University Press, 2010
1 online resource (xxix, 184 pages)
englisch
9780511761355
9780521192484
9780521122542
Full Text
Table of Contents:
  • Machine generated contents note: 1. Computational tasks and models; 2. The P versus NP Question; 3. Polynomial-time reductions; 4. NP-completeness; 5. Three relatively advanced topics; Epilogue: a brief overview of complexity theory.