Buch, Englisch, 372 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 587 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Buch, Englisch, 372 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 587 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-642-08684-7
Verlag: Springer
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.
Zielgruppe
Professional/practitioner
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
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.
