scientific article; zbMATH DE number 2086399

MaRDI QIDQ4736854zbMATH OpenFDO

Authors Jörg Flum, Martin Grohe

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2285/22850359.htm

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• Describing parameterized complexity classes
• scientific article; zbMATH DE number 1424025
• Machine-based methods in parameterized complexity theory
• scientific article; zbMATH DE number 1114020
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues

Cited in

(18)

• Describing parameterized complexity classes
• The complexity of first-order and monadic second-order logic revisited
• Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
• EPTAS for load balancing problem on parallel machines with a non-renewable resource
• Parameterized complexity classes beyond para-NP
• A parametric analysis of the state-explosion problem in model checking
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• Parameterized complexity: the main ideas and connections to practical computing
• A basic parameterized complexity primer
• Structure and specification as sources of complexity
• Parameterized Complexity Classes under Logical Reductions
• Computing Hitting Set Kernels By AC^0-Circuits
• A survey of the algorithmic aspects of modular decomposition
• scientific article; zbMATH DE number 1424025 (Why is no real title available?)
• Parameterized Parallel Computing and First-Order Logic
• scientific article; zbMATH DE number 7561704 (Why is no real title available?)
• Inductive Logic Programming
• Edge-treewidth: algorithmic and combinatorial properties

This page was built for publication:

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