Parameterized Complexity and Logic

DOI10.1007/978-3-540-73001-9_29MaRDI QIDQ5425329zbMATH OpenOpenAlexFDO

Authors Jörg Flum

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(5)

• Computation Models for Parameterized Complexity
• A Parameterized Halting Problem
• Parameterized Complexity Classes under Logical Reductions
• Decidability and complexity analysis by basic paramodulation
• Polynomial Time in the Parametric Lambda Calculus.

This page was built for publication: Parameterized Complexity and Logic

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