Bounded nondeterminism and alternation in parameterized complexity theory

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 13-29

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

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; POLYNOMIALS; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; CHARACTERIZATION; COMPUTER SCIENCE; DATABASE SYSTEMS; LABORATORIES; PARAMETERIZATION; TURING MACHINES;

PARAMETERIZED COMPLEXITY THEORY;

COMPUTATIONAL COMPLEXITY;

ALGORITHM DESIGN AND ANALYSIS; BIOLOGY COMPUTING; COMPLEXITY THEORY; COMPUTATIONAL BIOLOGY; LOGIC;

EID: 0043016271     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

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. M. Alekhnovich and A. Razborov. Resolution is not automatizable unless W[P] is tractable. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2001. To appear.
3. H.L. Bodlaender, R.G. Downey, M.R. Fellows, M.T. Hallett, and H.T. Wareham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11:49-57, 1995.
4. L. Cai, J. Chen, R.G. Downey, and M.R. Fellows. On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic, 36:321-337, 1997.
5. M. Cesati. The Turing way to the parameterized intractability, 2001. Submitted for publication.
6. A.K. Chandra, D. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
7. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
8. 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.
9. R.G. Downey, M.R. Fellows, and K. Regan. Parameterized circuit complexity and the W-hierarchy. Theoretical Computer Science, 191:97-115, 1998.
10. 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.
11. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 2nd edition, 1999.
12. 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.
13. J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113-145, 2001.
14. J. Flum and M. Grohe. Describing parameterized complexity classes. In H. Alt and A. Ferreira, editors, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, volume 2285 of Lecture Notes in Computer Science, pages 359-371. Springer-Verlag, 2002.
15. G. Gottlob, N. Leone, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Logic Programming and Nonmonotonic Reasoning, 5th International Conference, LPNMR'99, volume 1730 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, 1999.
16. M. Grohe. The parameterized complexity of database queries. In Proceedings of the 20th ACM Symposium on Principles of Database Systems, pages 82-92, 2001.
17. N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86-104, 1986.
18. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16:760-778, 1987.
19. N. Immerman. Descriptive Complexity. Springer-Verlag, 1999.
20. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
21. C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. Journal of Computer and System Sciences, 58:407-427, 1999.
22. U. Stege. Resolving Conflicts in Problems from Computational Biology. PhD thesis, ETH Zuerich, 2000. PhD Thesis No. 13364.
23. M.Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137-146, 1982.
24. M.Y. Vardi. On the complexity of bounded-variable queries. In Proceedings of the 14th ACM Symposium on Principles of Database Systems, pages 266-276, 1995.