Theory of Semi-Feasible Algorithms (Monographs in Theoretical Computer Science. An EATCS Series)

by Leen Torenvliet (Author), Lane Hemaspaandra (Author)

• New

  Illustrated
  2002

  $113.28

  The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness.