The complexity theory companion
Author(s)
Bibliographic Information
The complexity theory companion
（Texts in theoretical computer science, An EATCS series）
Springer, c2010
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
Originally published: 2002
Bibliography: p. [309]-334
Includes index
Description and Table of Contents
Description
Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.
Table of Contents
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.
by "Nielsen BookData"