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

DOI10.1007/978-3-540-74915-8_30zbMath1179.68060OpenAlexW2142120952MaRDI QIDQ3608426

Jörg Flum, Yijia Chen

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

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

Related Items

Parameterized random complexity, Lower Bounds for Kernelizations and Other Preprocessing Procedures