On miniaturized problems in parameterized complexity theory

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 314-336

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

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Fagin definability; Parameterized complexity; Subexponential algorithms

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY;

FAGIN-DEFINABILITY; PARAMETERIZED COMPLEXITY; SUBEXPONENTIAL ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 32144432883     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.10.003     Document Type: Conference Paper

References (15)

1. L. Cai, D. Juedes, Subexponential parameterized algorithms collapse the W -hierarchy, in: Proc. 28th Internat. Colloq. Automata, Languages and Programming (ICALP'01), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 273-284.
2. J. Chen, B. Chor, M. Fellows, X. Huang, D. Juedes, I. Kanj, and Ge. Xia Tight lower bounds for certain parameterized NP-hard problems Proc. 19th IEEE Annual Conf. Computational Complexity (CCC'04) 2004 150 160
3. J. Chen, X. Huang, I. Kanj, and G. Xia Linear FPT reductions and computational lower bounds Proc. 36th Annual ACM Symp. Theory of Computing 2004 212 221
4. P. Clote, and E. Kranakis Boolean Functions and Models of Computation 2003 Springer Berlin
5. R. Downey Parameterized complexity for the sceptic Proc. 18th IEEE Annual Conf. Computational Complexity (CCC'03) 2003 147 169
6. R. Downey, V. Estivill, M. Fellows, E. Prieto, F. Rosamond, Cutting up is hard to do: the parameterized complexity of k -cut and related problems, in: Proc. Computing: The Australasian Theory Symposium (CATS'03), Electronic Notes in Theoretical Computer Science, Vol. 78(0), 2003, pp. 1-14.
7. R. Downey, and M. Fellows Parameterized Complexity 1999 Springer Berlin
8. R. Downey, M. Fellows, K. Regan, Descriptive complexity and the W -hierarchy, in: P. Beame, S. Buss (Eds.), Proof Complexity and Feasible Arithmetic, AMS-DIMACS Volume Series, American Mathematical Society, Vol. 39, 1998, pp. 119-134.
9. M. Fellows, New directions and new challenges in algorithm design and complexity, parameterized, in: Proc. 8th Internat. Workshop on Algorithms and Data Structures (WADS 2003), Lecture Notes in Computer Science, Vol. 2748, Springer, Berlin, 2003, pp. 505-519.
10. J. Flum, and M. Grohe Fixed-parameter tractability, definability, and model checking SIAM J. Comput. 31 1 2001 113 145
11. J. Flum, M. Grohe, Parameterized complexity and subexponential time, in: The Complexity Column of the Bulletin of the European Association for Theoretical Computer Science (EATCS), Vol. 84, October, 2004.
12. J. Flum, M. Grohe, M. Weyer, Limited nondeterminism and parameterized complexity theory, in: Proc. 31st Internat. Colloq. Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science, Vol. 3142, Springer, Berlin, 2004, pp. 555-567.
13. R. Impagliazzo, and R. Paturi Complexity of k -SAT J. Comput. System Sci. 62 2 2001 367 375
14. R. Impagliazzo, R. Paturi, and F. Zane Which problems have strongly exponential complexity? J. Comput. System Sci. 63 4 2001 512 530
15. G. Nemhauser, and L. Trotter Vertex packings: structural properties and algorithms Math. Programming 8 1975 232 248