Lane A. Hemaspaandra,
Mitsunori Ogihara
Springer Berlin Heidelberg
2002e druk, 2001
9783540674191
The Complexity Theory Companion
Specificaties
Gebonden, 372 blz.
|
Engels
Springer Berlin Heidelberg |
2002e druk, 2001
ISBN13: 9783540674191
Rubricering
Onderdeel van serie
Texts in Theoretical Computer Science. An EATCS Series
Levertijd ongeveer 8 werkdagen
Samenvatting
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.
Specificaties
ISBN13:9783540674191
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:372
Uitgever:Springer Berlin Heidelberg
Druk:2002
Hoofdrubriek:Programmeren, Computer en informatica
Inhoudsopgave
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.