Model-checking problems as a basis for parameterized intractability

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 388-397

  Flum, Jörg ^a   Grohe, Martin ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; THEOREM PROVING;

FIRST-ORDAR LOGICS; LINEAR TIME TEMPORAL LOGICS; PARAMETERIZED INDUCTABILITY;

COMPUTER SCIENCE;

EID: 4544236681     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319633     Document Type: Conference Paper

References (19)

1. K.A. Abrahamson, R.G. Downey, and M.R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of pure and applied logic, 73:235-276, 1995.
2. Y. Chen and J. Flum. Machine characterizations of the classes of the W-hierarchy. In M. Baaz and J. Makowsky, editors, Proceedings of the 17th International Workshop on Computer Science Logic, volume 2803 of Lecture Notes in Computer Science, pages 114-127. Springer-Verlag, 2003.
3. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24:873-921, 1995.
4. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141:109-131, 1995.
5. R.G. Downey and M.R. Fellows. Threshold dominating sets and an improved characterization of W[2]. Theoretical Computer Science, 209:123-140, 1998.
6. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
7. R.G. Downey, M.R. Fellows, and K. Regan. Descriptive complexity and the W-hierarchy. In P. Beame and S. Buss, editors, Proof Complexity and Feasible Arithmetic, volume 39 of AMS-DIMACS Volume Series, pages 119-134. AMS, 1998.
8. R.G. Downey, M.R. Fellows, and K. Regan. Parameterized circuit complexity and the W-hierarchy. Theoretical Computer Science, 191:97-115, 1998.
9. R.G. Downey, M.R. Fellows, and U. Taylor. The parameterized complexity of relational database queries and an improved characterization of W[1]. In D.S. Bridges, C. Calude, P. Gibbons, S. Reeves, and I.H. Witten, editors, Combinatorics, Complexity, and Logic - Proceedings of DMTCS '96, pages 194-213. Springer-Verlag, 1996.
10. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43-73, 1974.
11. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. Journal of the ACM, 49(6):716-752, 2002.
12. J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113-145, 2001.
13. J. Flum and M. Grohe. Model-checking problems as a basis for parameterized intractability. Technical Report 23/2003, Fakultät für Mathematik und Physik, Albert-Ludwigs-Universität Freiburg, 2003.
14. M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. To appear in the LICS'01 Special Issue of Annals of Pure and Applied Logic.
15. M. Grohe. The parameterized complexity of database queries. In Proceedings of the 20th ACM Symposium on Principles of Database Systems, pages 82-92, 2001.
16. O. Lichtenstein and A. Pnueli. Finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACM Symposium on the Principles of Programming Languages, pages 97-107, 1985.
17. A.P. Sistla and E.M. Clarke. The complexity of prepositional linear temporal logic. Journal of the ACM, 32(3):733-749, 1985.
18. L.J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.
19. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137-146, 1982.