R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xv + 533 pp [Book Review]

Bulletin of Symbolic Logic 8 (4):528-529 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl/1182353925

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
Parameterized.R. G. Downey & M. R. Fellows - forthcoming - Complexity.
The parameterized complexity of maximality and minimality problems.Yijia Chen & Jörg Flum - 2008 - Annals of Pure and Applied Logic 151 (1):22-61.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
Sparse parameterized problems.Marco Cesati & Michael R. Fellows - 1996 - Annals of Pure and Applied Logic 82 (1):1-15.
On the parameterized complexity of short computation and factorization.Liming Cai, Jianer Chen, Rodney G. Downey & Michael R. Fellows - 1997 - Archive for Mathematical Logic 36 (4-5):321-337.
Advice classes of parameterized tractability.Liming Cai, Jianer Chen, Rodney G. Downey & Michael R. Fellows - 1997 - Annals of Pure and Applied Logic 84 (1):119-138.
Parameterized counting problems.Catherine McCartin - 2006 - Annals of Pure and Applied Logic 138 (1):147-182.
Index sets and parametric reductions.Rod G. Downey & Michael R. Fellows - 2001 - Archive for Mathematical Logic 40 (5):329-348.
Schöning Uwe. Complexity and structure. Lecture notes in computer science, vol. 211. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1986, v + 99 pp. [REVIEW]Stephen R. Mahaney - 1989 - Journal of Symbolic Logic 54 (3):1106-1107.
Parameterized Complexity Theory.J. Flum - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
J. Flum and M. Grohe, Parameterized complexity theory.Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
REVIEWS-Parameterized complexity theory.J. Flum, M. Grohe & Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
Ferrante Jeanne and Rackoff Charles W.. The computational complexity of logical theories. Lecture notes in mathematics, vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 pp. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.

Analytics

Added to PP
2014-03-24

Downloads
40 (#378,975)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references