Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping

DOI10.1093/logcom/exn029zbMath1169.68020OpenAlexW2883953303MaRDI QIDQ3611723

Jörg Flum, Yijia Chen

Publication date: 2 March 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exn029

zbMATH Keywords

parameterized complexityexponential time complexityminiaturization mapping

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Parameterized Complexity and Subexponential-Time Computability ⋮ Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications ⋮ Parameterized and subexponential-time complexity of satisfiability problems and applications ⋮ Lower bounds for kernelizations and other preprocessing procedures

This page was built for publication: Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping