With its cogent overview of the essentials of parallel computation as well as lists of P-complete and open problems, extensive remarks corresponding to each problem, and extensive references, this book is the ideal introduction to parallel computing.

PART I: Background and Theory; 1. Introduction; 2. Parallel Models and Complexity Classes; 3. Two Basic P-Complete Problems; 4. Evidence that NC Does Not Equal P; 5. The Circuit Value Problem; 6. Parallel Versions of Sequential Paradigms; 7. Boolean Circuits; PART II: P-Complete and Open Problems; 8. List of P-Complete Problems; 9. Open Problems

Raymond GreenlawAssistant Professor, Department of Computer Science, University of New Hampshire, H. James HooverAssociate Professor, Department of Computer Science, University of Alberta, Canada, Walter L. RuzzoProfessor, Department of Computer Science, University of Washington

"This is an excellent book about the classification of computing problems....I am sure that it can be useful as a textbook for students or as basic material for researchers wanting to start some research in this area." --Mathematical Reviews