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

DOI10.1007/978-3-540-74915-8_30MaRDI QIDQ3608426zbMATH OpenOpenAlexFDO

Authors Yijia Chen, Jörg Flum

Publication date 5 March 2009

Published in Computer Science Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74915-8_30

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
• An Isomorphism Between Subexponential and Parameterized Complexity Theory
• On miniaturized problems in parameterized complexity theory
• Parameterized and Exact Computation
• On Parameterized Exponential Time Complexity

Cited in

(6)

• Parameterized random complexity
• Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
• An Isomorphism Between Subexponential and Parameterized Complexity Theory
• Lower bounds for kernelizations and other preprocessing procedures
• Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping
• On miniaturized problems in parameterized complexity theory

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

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