The Complexity Theory Companion
By: by Lane A. Hemaspaandra, Mitsunori Ogihara
Contributors: Ogihara, Mitsunori
Series: Texts in Theoretical Computer Science An EATCS Series; Texts in Theoretical Computer Science An EATCS Series
Publisher: Springer Berlin Heidelberg
Published: 2002
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] /
Number of pages: 372
ISBN-13: 9783642086847; 9783662048801
Subjects: Combinatorics; Computational complexity; Computer science; Data structures (Computer science); Computer software
Description: 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.
Notes: Online full text is restricted to subscribers.

Also available in print.

Mode of access: World Wide Web.