The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.

The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields. This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.

Offers an algorithmic approach to computational complexity Intuitive approach makes this field more easily and fully accessible to readers at all levels Includes supplementary material: sn.pub/extras

Inhalt

1. The Self-Reducibility Technique.- 2. The One-Way Function Technique.- 3. The Tournament Divide and Conquer Technique.- 4. The Isolation Technique.- 5. The Witness Reduction Technique.- 6. The Polynomial Interpolation Technique.- 7. The Nonsolvable Group Technique.- 8. The Random Restriction Technique.- 9. The Polynomial Technique.- A. A Rogues' Gallery of Complexity Classes.- B. A Rogues' Gallery of Reductions.- References.