Computation models for parameterized complexity

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

Abstract This article has no associated abstract. (fix it)
Keywords Turing machine  Computational complexity  Parameterized computational complexity
Categories (categorize this paper)
DOI 10.1002/malq.19970430204
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,373
Through your library

References found in this work BETA

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

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

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.
REVIEWS-Parameterized Complexity Theory.J. Flum, M. Grohe & Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2).

Analytics

Added to PP index
2013-10-31

Total views
28 ( #331,338 of 2,286,142 )

Recent downloads (6 months)
9 ( #106,800 of 2,286,142 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature