Multivariate complexity theory

DOI10.1007/978-1-4614-1168-0_13MaRDI QIDQ5397504zbMATH OpenOpenAlexFDO

Authors Michael R. Fellows, Serge Gaspers, Frances Rosamond

Publication date 21 February 2014

Published in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-1168-0_13

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40)

Recommendations

• Reflections on multivariate algorithmics and problem parameterization
• Fundamentals of parameterized complexity
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• Parameterized complexity: the main ideas and connections to practical computing
• Towards fully multivariate algorithmics: some new results and directions in parameter ecology

Cited in

(9)

• An introduction to multi-parameter complexity analysis of discrete problems
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• A parameterized complexity analysis of combinatorial feature selection problems
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
• Reflections on multivariate algorithmics and problem parameterization
• Towards fully multivariate algorithmics: some new results and directions in parameter ecology
• Confronting intractability via parameters
• Complexity of splits reconstruction for low-degree trees
• Multilist layering: Complexity and applications

This page was built for publication: Multivariate complexity theory

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