Simplifying the weft hierarchy

Theoretical Computer Science

Volumn 351, Issue 3, 2006, Pages 303-313

  Buss, Jonathan F ^a   Islam, Tarique ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Fixed parameter complexity; W hierarchy; Weft

Indexed keywords

COMPUTATIONAL METHODS; HIERARCHICAL SYSTEMS; THEOREM PROVING;

FIXED-PARAMETER COMPLEXITY; W-HIERARCHY; WEFT;

COMPUTATIONAL COMPLEXITY;

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

References (6)

1. L. Cai, and J. Chen On the amount of nondeterminism and the power of verifying SIAM J. Comput. 26 3 1997 733 750
2. L. Cai, J. Chen, R.G. Downey, and M.R. Fellows On the complexity of short computation and factorization Arch. Math. Logic 36 1997 321 337
3. Y. Chen, J. Flum, Machine characterization of the classes of the W-hierarchy, in: Computer Science Logic: CSL 2003, Lecture Notes in Computer Science, Springer, Berlin, 2003, pp. 114-127.
4. Y. Chen, J. Flum, and M. Grohe Bounded nondeterminism and alternation in parameterized complexity theory 18th Annu. IEEE Conf. on Computational Complexity 2003 18 29
5. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer New York
6. J. Flum, and M. Grohe Fixed-parameter tractability, definability, and model-checking SIAM J. Comput. 31 1 2001 113 145