"Parameterized complexity" - Information and Links:

Parameterized complexity - Info and Reading Options

Book's cover
The cover of “Parameterized complexity” - Open Library.

"Parameterized complexity" was published by Springer in 1999 - New York, it has 533 pages and the language of the book is English.


“Parameterized complexity” Metadata:

  • Title: Parameterized complexity
  • Author:
  • Language: English
  • Number of Pages: 533
  • Publisher: Springer
  • Publish Date:
  • Publish Location: New York

“Parameterized complexity” Subjects and Themes:

Edition Specifications:

  • Pagination: xv, 533 p. :

Edition Identifiers:

AI-generated Review of “Parameterized complexity”:


"Parameterized complexity" Description:

The Open Library:

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.

Read “Parameterized complexity”:

Read “Parameterized complexity” by choosing from the options below.

Search for “Parameterized complexity” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Parameterized complexity” in Libraries Near You:

Read or borrow “Parameterized complexity” from your local library.

Buy “Parameterized complexity” online:

Shop for “Parameterized complexity” on popular online marketplaces.



Find "Parameterized Complexity" in Wikipdedia