Parameterized Complexity

by

Write The First Customer Review

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 ...

Parameterized Complexity 2012, Springer-Verlag New York Inc., New York, NY

ISBN-13: 9781461267980

Paperback

Select
Parameterized Complexity 1998, Springer, New York, NY

ISBN-13: 9780387948836

1999 edition

Hardcover

Select