Advertisement

The Complexity Theory Companion

  • Lane A. Hemaspaandra
  • Mitsunori Ogihara

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 1-29
  3. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 31-44
  4. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 45-65
  5. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 67-89
  6. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 91-108
  7. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 109-166
  8. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 167-195
  9. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 197-233
  10. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 235-261
  11. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 263-303
  12. Lane A. Hemaspaandra, Mitsunori Ogihara
    Pages 305-308
  13. Back Matter
    Pages 309-372

About this book

Introduction

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.

Keywords

Complexity Theory Computational Complexity Foundations Graph Sim Theoretical Computer Science Theory of Computation algorithms complexity

Authors and affiliations

  • Lane A. Hemaspaandra
    • 1
  • Mitsunori Ogihara
    • 1
  1. 1.Department of Computer ScienceRochesterUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-04880-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-08684-7
  • Online ISBN 978-3-662-04880-1
  • Series Print ISSN 1862-4499
  • Buy this book on publisher's site
Industry Sectors
Electronics
IT & Software
Telecommunications
Aerospace
Engineering