scientific article; zbMATH DE number 1424025

zbMath0943.03029MaRDI QIDQ4945215

Martin Grohe

Publication date: 23 March 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyparameterized complexitydescriptive complexity theoryfinite structure

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Related Items (9)

An analysis of the W*-hierarchy ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Unnamed Item ⋮ Tractable answer-set programming with weight constraints: bounded treewidth is not enough ⋮ The ring grooming problem ⋮ Bounded treewidth as a key to tractability of knowledge representation and reasoning ⋮ On the complexity of Gödel's proof predicate ⋮ A linear-time kernelization for the rooted \(k\)-leaf outbranching problem

This page was built for publication: