Tell your friends about this item:
Parameterized Complexity - Monographs in Computer Science Rodney G. Downey 1999 edition
Parameterized Complexity - Monographs in Computer Science
Rodney G. Downey
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.
533 pages, biography
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | November 6, 1998 |
| ISBN13 | 9780387948836 |
| Publishers | Springer-Verlag New York Inc. |
| Pages | 533 |
| Dimensions | 155 × 235 × 30 mm · 907 g |
| Language | English |
More by Rodney G. Downey
Show allSee all of Rodney G. Downey ( e.g. Hardcover Book and Paperback Book )