Computer Science Logic

DOI10.1007/b13224zbMath1116.68470OpenAlexW2623947920MaRDI QIDQ5292631

Jörg Flum, Yijia Chen

Publication date: 21 June 2007

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

Full work available at URL: https://doi.org/10.1007/b13224

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Simplifying the weft hierarchy ⋮ Describing parameterized complexity classes ⋮ Parameterized Complexity Classes under Logical Reductions ⋮ Machine-based methods in parameterized complexity theory ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ Unnamed Item ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness

This page was built for publication: Computer Science Logic