Bounded fixed-parameter tractability and log2n nondeterministic bits

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

Volumn 3142, Issue , 2004, Pages 555-567

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

^a UNIVERSITY OF FREIBURG   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MODEL CHECKING; PARAMETERIZATION; POLYNOMIAL APPROXIMATION;

COMPLEXITY THEORY; FIXED-PARAMETER TRACTABILITY; FIXED-PARAMETER TRACTABLE ALGORITHMS; HIGH COMPLEXITY; NATURAL MODELS; NONDETERMINISTIC POLYNOMIAL; PARAMETERIZED COMPLEXITY; PARAMETERIZED PROBLEMS;

PARAMETER ESTIMATION;

EID: 33646522733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_48     Document Type: Article

References (17)

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. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 194-242. Elsevier Science Publishers, 1990.
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, and M. R. Fellows. Parameterized learning complexity. In Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, pages 51-57, 1993.
5. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness III: Some structural aspects of the W-hierarchy. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory, pages 166-191. Cambridge University Press, 1993.
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. T. Eiter, G. Gottlob, and K. Makino. New results on monotone dualization and generating hypergraph transversals. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 14-22, 2002.
9. J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113-145, 2001.
10. J. Flum and M. Grohe. Model-checking problems as a basis for parameterized intractability. To appear in Proceedings of the 19th IEEE Symposium on Logic in Computer Science, 2004. Full version available as Technical Report 23/2003, Fakultät für Mathematik und Physik, Albert-Ludwigs-Universität Freiburg, 2003.
11. 2n nondeterministic bits. Technical Report 04/2004, Fakultät für Mathematik und Physik, Albert-Ludwigs-Universität Freiburg, 2004.
12. M. Frick and 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, pages 215-224, 2002.
13. M. Grohe. Parameterized complexity for the database theorist. SIGMOD Record, 31(4):86-96, 2002.
14. C. Kintala and P. Fischer. Refining nondeterminism in relativised polynomial time bounded computations. SIAM Journal on Computing, 9:46-53, 1980.
15. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of V-C dimension. Journal of Computer and System Sciences, 53:161-170, 1996.
16. P-complete. Journal of Computer and System Sciences, 58:177-182, 1999.
17. M. Weyer. PhD thesis. In preparation.