Computation models for parameterized complexity

&
Mathematical Logic Quarterly 43 (2):179-202 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19970430204

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

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

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.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
How molecules matter to mental computation.Paul Thagard - 2002 - Philosophy of Science 69 (3):497-518.
Transcending Turing computability.B. J. Maclennan - 2003 - Minds and Machines 13 (1):3-22.
Representation operators and computation.Brendan Kitts - 1999 - Minds and Machines 9 (2):223-240.
J. Flum and M. Grohe, Parameterized complexity theory.Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
Logical openness in cognitive models.Prof Ignazio Licata - 2008 - Epistemologia:177-192.
REVIEWS-Parameterized complexity theory.J. Flum, M. Grohe & Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
Statistical models as cognitive models of individual differences in reasoning.Andrew J. B. Fugard & Keith Stenning - 2013 - Argument and Computation 4 (1):89 - 102.
Hierarchical Bayesian models as formal models of causal reasoning.York Hagmayer & Ralf Mayrhofer - 2013 - Argument and Computation 4 (1):36 - 45.
From logic to physics: How the meaning of computation changed over time.Itamar Pitowsky - unknown
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
The Expected Complexity of Problem Solving.Kevin Kelly & Peter Spirtes - unknown
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.

Analytics

Added to PP
2013-10-31

Downloads
32 (#500,820)

6 months
2 (#1,202,487)

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

Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.

Add more references