## What this Page is AboutThe Complexity Theory Companion (Book),
Lane A. Hemaspaandra and Mitsunori Ogihara, Springer-Verlag,
ISBN 3-540-67419-5, hardcover edition 2002, softcover edition 2010, 382
pages, 43
figures.
Click on the thumbnail to
see a larger photo. |

Publisher's Blurb

List of Chapters

Preface, Table of Contents, Sample Chapters, and the Index

Transparency Masters That Can Be Used to Teach The Book

Order From Amazon

Publisher's Catalog Entry

How to Get A Desk Copy From The Publisher

Errata

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.

- The Preface: (as pdf), (as postscript).
- The Table of Contents: (as pdf), (as postscript).
- The Self-Reducibility Technique: (as pdf), (as postscript). (This chapter covers whether NP is likely to have sparse complete sets, and whether any sparse sets at all are likely to be in NP-P. Coverage includes the Left Set Technique, the Hartmanis-Immerman-Sewelson Encoding, Mahaney's Theorem, and the Ogiwara-Watanabe Theorem.)
- The Isolation Technique: (as pdf), (as postscript). (This chapter's coverage includes the Isolation Lemma, the Valiant-Vazirani Theorem, Toda's Theorem, and the Wigderson/Gal/Allender/Reinhardt work that led to NL/poly=UL/poly.)
- The Index: (as pdf), (as postscript).

Return to Top of Page