• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Complexity Theory Companion

The Complexity Theory Companion

Hardcover

Series: Texts in Theoretical Computer Science. an Eatcs

General ComputersGeneral ScienceProgramming

ISBN10: 3540674195
ISBN13: 9783540674191
Publisher: Springer
Published: Dec 1 2001
Pages: 372
Weight: 1.56
Height: 1.03 Width: 6.28 Depth: 9.52
Language: English

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.

1 different editions

Also available

Also in

General Science