COMPUTING
Edited by E.G. Coffman, Jr., J.K. Lenstra and A.H.G. Rinnooy Kan
CHAPTER 9
Computational Complexity
L.J. Stockmeyer
1. Overview*
2. Basic definitions
3. NP-complete problems
4. Coping with NP-complete problems- Related theory
5. The world beyond NP
6. Approaches to the P vs. NP question
7. Parallel computation
Acknowledgement
References
* The first two pages of the chapters are available as PDF file.
Complete chapters on ScienceDirect
[Description and order information]
