Parameterized complexity
by R. G. Downey
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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Includes bibliographical references (p. [489]-516) and index.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created April 1, 2008
- 11 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| July 15, 2024 | Edited by MARC Bot | import existing book |
| December 19, 2023 | Edited by ImportBot | import existing book |
| December 25, 2021 | Edited by ImportBot | import existing book |
| November 25, 2020 | Edited by MARC Bot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |