Hundreds of Mathematics books at half price + FREE shipping! Get yours now >>

Texts in Theoretical Computer Science. An EATCS Series

The Complexity Theory Companion

Authors: Hemaspaandra, Lane, Ogihara, Mitsunori

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-662-04880-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-540-67419-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • ISBN 978-3-642-08684-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

Reviews

From the reviews of the first edition:

"The introduction … begins with two secrets: that algorithms are at the heart of complexity theory, and moreover that simple algorithms are at the heart of complexity theory. The main body of the book then proceeds to try and illustrate this view. … While all the chapters primarily deal with a succession of theorems, lemmas and proofs, the surrounding text makes it fairly accessible and readable. … The appendices are very well laid out and could probably replace a small library of textbooks." (A. Weaver, Journal of the Operational Research Society, Vol. 54, 2004)

"The book is intended for readers who seek an accessible, algorithmically oriented research-centered, up-to-date guide to several interesting techniques of computational complexity. In contrast to the organization of other books, each chapter of this book focuses on one particular technique in complexity theory. … The book contains two appendices, the first presenting a concise overview on complexity classes, the second one on reductions. The book presents a survey on a great variety of recent interesting techniques in complexity." (Ludwig Staiger, Zentralblatt MATH, Vol. 993, 2002)


Table of contents (11 chapters)

  • The Self-Reducibility Technique

    Hemaspaandra, Lane A. (et al.)

    Pages 1-29

  • The One-Way Function Technique

    Hemaspaandra, Lane A. (et al.)

    Pages 31-44

  • The Tournament Divide and Conquer Technique

    Hemaspaandra, Lane A. (et al.)

    Pages 45-65

  • The Isolation Technique

    Hemaspaandra, Lane A. (et al.)

    Pages 67-89

  • The Witness Reduction Technique

    Hemaspaandra, Lane A. (et al.)

    Pages 91-108

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-662-04880-1
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-540-67419-1
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • ISBN 978-3-642-08684-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
The Complexity Theory Companion
Authors
Series Title
Texts in Theoretical Computer Science. An EATCS Series
Copyright
2002
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-04880-1
DOI
10.1007/978-3-662-04880-1
Hardcover ISBN
978-3-540-67419-1
Softcover ISBN
978-3-642-08684-7
Series ISSN
1862-4499
Edition Number
1
Number of Pages
XIII, 372
Topics