Modified parameterized complexity theory

MaRDI QIDQ5451198zbMATH OpenFDO

Authors Mark Weyer

Publication date 18 March 2008

zbMATH Keywords

computational complexityparameterized complexitybounded fixed-parameter tractability

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Bounded fixed-parameter tractability and reducibility
• Parametrized complexity theory.
• Parameterized and Exact Computation
• scientific article; zbMATH DE number 512804
• Computation Models for Parameterized Complexity

Cited in

(5)

• Practical algorithms for MSO model-checking on tree-decomposable graphs
• Computation Models for Parameterized Complexity
• Automata, Languages and Programming
• Bounded fixed-parameter tractability and reducibility
• Parameterized and Exact Computation

This page was built for publication: Modified parameterized complexity theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451198)