Bounded fixed - parameter tractability: The case 2poly(k)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 49-60

  Weyer, Mark ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

COMPLETE PROBLEMS; FIXED-PARAMETER TRACTABILITY; MACHINE MODELS; MODEL CHECKING PROBLEM; PARAMETER DEPENDENCE; PROPOSITIONAL SATISFIABILITY PROBLEMS;

MODEL CHECKING;

EID: 27844434494     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_5     Document Type: Article

References (7)

1. 2n nondeterministic bits. Technical Report 04, Fakultät für Mathematik und Physik, Eckerstraβe l, 79104 Freiburg, Germany (2004)
2. Frick, M., Grohe, M.: The complexity of first - order and monadic second - order logic revisited. Preprint (2003)
3. Downey, R., Fellows, M.: Parameterized complexity. Springer - Verlag, New York (1999)
4. Flum, J., Grohe, M.: Model - checking problems as a basis for parameterized intractability. Technical Report 23, Fakultät für Mathematik und Physik, Eckerstraβe l, 79104 Freiburg, Germany (2003)
5. Chen, Y., Flum, J.: Machine characterizations of classes of the W - hierarchy. In: CSL. Volume 2803 of Lecture Notes in Computer Science., Springer (2003) 114-127
6. Thomas, W.: Languages, automata, and logic. Technical Report 9607, Institut für Informatik und Praktische Mathematik, Christian - Albrechts - Universität Kiel, Germany (1996)
7. (Weyer, M.) Dissertation, in preparation.