1475.37 PLN with VAT
$331.88 / €270.19 / £246.13
442.61 PLN with VAT
$99.56 / €81.06 / £73.84
590.15 PLN with VAT
$132.75 / €108.08 / £98.45
737.68 PLN with VAT
$165.94 / €135.10 / £123.07
885.22 PLN with VAT
$199.13 / €162.11 / £147.68
958.99 PLN with VAT
$215.72 / €175.62 / £159.99
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. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.
Parameterized Complexity