Publisher description for Parameterized complexity / R.G. Downey, M.R. Fellows.

Bibliographic record and links to related information available from the Library of Congress catalog

Information from electronic data provided by the publisher. May be incomplete or contain other coding.

This monograph presents 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. In doing so, the reader is introduced to new classes of algorithms which may be analysed more precisely than hereto. 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.

Library of Congress subject headings for this publication:
Computational complexity.