Title: Parameterized complexity
First published: 1999
Description: This monograph presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking "k-slices" of the language. In doing so, the reader is introduced to new classes of algorithms which may be analyzed more precisely than heretofore.

The authors have made the book as self-contained as possible, and a lot of background material is included. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest in this book.
Subjects: Computational complexity, COMPUTABILIDADE E COMPLEXIDADE, Berechnungskomplexität, Computer science, mathematics, Computers &amp; the internet, Computer science
LC classification: QA267.7 .D68 1999