Udvidet returret til d. 31. januar 2025
Bag om 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9783540422006
  • Indbinding:
  • Hardback
  • Sideantal:
  • 150
  • Udgivet:
  • 28. oktober 2002
  • Udgave:
  • 2003
  • Størrelse:
  • 166x241x16 mm.
  • Vægt:
  • 380 g.
  • BLACK NOVEMBER
  Gratis fragt
Leveringstid: 2-3 uger
Forventet levering: 10. december 2024

Beskrivelse af 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.

Brugerbedømmelser af Theory of Semi-Feasible Algorithms



Find lignende bøger
Bogen Theory of Semi-Feasible Algorithms findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.