Parameterized Complexity
Изчерпано количество
Продуктът не е наличен
Запиши се за известие при зареждане
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Информация за "Parameterized Complexity"
- SKU 9781461267980
- Weight 0.836000
- ISBN 9781461267980
- Вид корица Paperback / softback
- Издателство Springer-Verlag New York Inc.
- Брой страници 533
The information below is required for social login