Bounded fixed-parameter tractability and log2 n nondeterministic bits

Journal of Computer and System Sciences

Volumn 72, Issue 1, 2006, Pages 34-71

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

^a UNIVERSITY OF FREIBURG   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Fixed parameter tractability; Limited nondeterminism

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

COMPLEXITY THEORY; FIXED-PARAMETER TRACEABILITY; LIMITED NONDETERMINISM; POLYNOMIAL TIME ALGORITHMS;

PARAMETER ESTIMATION;

EID: 27844585381     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.06.003     Document Type: Article

References (19)

1. K. Abrahamson, R. Downey, and M. Fellows Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs Ann. Pure Appl. Logic 73 1995 235 276
2. B. Courcelle Graph rewriting: an algebraic and logic approach J. van Leeuwen Handbook of Theoretical Computer Science vol. B 1990 Elsevier Science Publishers Amsterdam 194 242
3. R. Downey, Parameterized complexity for the skeptic, in: Proceedings of the 18th IEEE Conference on Computational Complexity, 2003.
4. R.G. Downey, P.A. Evans, M.R. Fellows, Parameterized learning complexity, in: Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993, pp. 51-57.
5. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness III: some structural aspects of the W-hierarchy K. Ambos-Spies S. Homer U. Schoning Complexity Theory 1993 Cambridge University Press Cambridge 166 191
6. R. Downey, and M. Fellows Parameterized Complexity 1999 Springer Berlin
7. R. Downey, M. Fellows, K. Regan, Descriptive complexity and the W-hierarchy, in: P. Beame, S. Buss (Eds.), Proof Complexity and Feasible Arithmetic, vol. 39 of AMS-DIMACS Volume Series, American Mathematical Society, Providence, RI, 1998, pp. 119-134.
8. T. Eiter, G. Gottlob, K. Makino, New results on monotone dualization and generating hypergraph transversals, in: Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 14-22.
9. J. Flum, M. Frick, and M. Grohe Query evaluation via tree-decompositions J. ACM 49 6 2002 716 752
10. J. Flum, and M. Grohe Fixed-parameter tractability, definability, and model checking SIAM J. Comput. 31 1 2001 113 145
11. J. Flum, and M. Grohe Model-checking problems as a basis for parameterized intractability Logical Methods Comput. Sci. 1 1 2005
12. M. Frick, M. Grohe, The complexity of first-order and monadic second-order logic revisited, in: Proceedings of the 17th IEEE Symposium on Logic in Computer Science, 2002, pp. 215-224.
13. M. Grohe Parameterized complexity for the database theorist SIGMOD Record 31 4 2002 86 96
14. C. Kintala, and P. Fischer Refining nondeterminism in relativised polynomial time bounded computations SIAM J. Comput. 9 1980 46 53
15. C. Papadimitriou Computational Complexity 1994 Addison-Wesley Reading, MA
16. C.H. Papadimitriou, and M. Yannakakis On limited nondeterminism and the complexity of V-C dimension Journal of Computer and System Sciences 53 1996 161 170
17. C. Papadimitriou, and M. Yannakakis On the complexity of database queries J. Comput. System Sci. 58 1999 407 427
18. 3-complete J. Comput. System Sci. 58 1999 177 182
19. M. Weyer, Bounded fixed-parameter tractability: the case 2 poly (k ), in: R. Downey, M. Fellows, F. Dehne (Eds.), Proceedings of the First International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science, vol. 3162, Springer, Berlin, 2004, pp. 49-60.