We a good story
Quick delivery in the UK
About Theory of Semi-Feasible Algorithms

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.

Show more
  • Language:
  • English
  • ISBN:
  • 9783540422006
  • Binding:
  • Hardback
  • Pages:
  • 150
  • Published:
  • October 27, 2002
  • Edition:
  • 2003
  • Dimensions:
  • 166x241x16 mm.
  • Weight:
  • 380 g.
Delivery: 2-3 weeks
Expected delivery: December 5, 2024

Description of Theory of Semi-Feasible Algorithms

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.

User ratings of Theory of Semi-Feasible Algorithms



Find similar books
The book Theory of Semi-Feasible Algorithms can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.