Parameterized Complexity (Paperback, Softcover reprint of the original 1st ed. 1999)

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Monographs in Computer Science
Release date:	December 2012
First published:	1999
Authors:	Rodney G. Downey • M.R. Fellows
Dimensions:	235 x 155 x 28mm (L x W x T)
Format:	Paperback
Pages:	533
Edition:	Softcover reprint of the original 1st ed. 1999
ISBN-13:	978-1-4612-6798-0
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	1-4612-6798-6
Barcode:	9781461267980

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!