Theory of Semi-Feasible Algorithms
- Indbinding:
- Hardback
- Sideantal:
- 150
- Udgivet:
- 28. Oktober 2002
- Udgave:
- 2003
- Størrelse:
- 166x241x16 mm.
- Vægt:
- 380 g.
Leveringstid:
2-3 uger
Forventet levering: 9. Oktober 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
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Theory of Semi-Feasible Algorithms findes i følgende kategorier:
© 2024 Pling BØGER Registered company number: DK43351621