Advertisement

Theory of Semi-Feasible Algorithms

  • Lane A. Hemaspaandra
  • Leen Torenvliet

Table of contents

  1. Front Matter
    Pages i-x
  2. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 1-16
  3. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 17-40
  4. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 41-59
  5. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 61-78
  6. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 79-103
  7. Lane A. Hemaspaandra, Leen Torenvliet
    Pages 105-113
  8. Back Matter
    Pages 115-149

About this book

Introduction

This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues.

Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.

Keywords

Algorithms Circuits Complexity Computer Discrete Mathematics complexity theory computer science semi-feasible algorithms

Authors and affiliations

  • Lane A. Hemaspaandra
    • 1
  • Leen Torenvliet
    • 2
  1. 1.Department of Computer ScienceUniversity of RochesterRochesterUSA
  2. 2.Department of Computer ScienceUniversity of AmsterdamAmsterdamThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-05080-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-07581-0
  • Online ISBN 978-3-662-05080-4
  • Series Print ISSN 1431-2654
  • Buy this book on publisher's site