Parameterized Complexity (Monographs in Computer Science) Export

@book{citeulike:615930, abstract = {{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.}}, author = {Downey, Rod G. and Fellows, M. R.}, citeulike-article-id = {615930}, citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/038794883X}, citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21&path=ASIN/038794883X}, citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21&path=ASIN/038794883X}, citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/038794883X}, citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/038794883X/citeulike00-21}, citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/038794883X}, citeulike-linkout-6 = {http://www.worldcat.org/isbn/038794883X}, citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN038794883X}, citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=038794883X&index=books&linkCode=qs}, citeulike-linkout-9 = {http://www.librarything.com/isbn/038794883X}, day = {06}, howpublished = {Hardcover}, isbn = {038794883X}, keywords = {book, parameterized\_complexity}, month = {November}, posted-at = {2006-05-07 05:50:17}, priority = {0}, publisher = {Springer}, title = {Parameterized Complexity (Monographs in Computer Science)}, url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/038794883X}, year = {1998} }

TY - BOOK ID - citeulike:615930 L3 - citeulike-article-id:615930 N2 - {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.} SN - 038794883X TI - Parameterized Complexity (Monographs in Computer Science) PB - Springer KW - book KW - parameterized_complexity AU - Downey, Rod AU - Fellows, MR PY - 1998/11/06/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/038794883X ER -