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.
Информация за "Theory of Semi-Feasible Algorithms"
- SKU 9783540422006
- Weight 0.380000
- ISBN 9783540422006
- Вид корица Hardback
- Издателство Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Брой страници 150
The information below is required for social login