Proves fine-grained nearly ETH-tight bounds for Courcelle's theorem depending on treewidth t and the number of first-order and second-order variables in each quantifier alternation block of the MSO formula.
Elementary first-order model checking for sparse graphs , year =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
PaJAM generalizes JAM/IAM/PAM via backtracking depth and extracts its step count from non-idempotent intersection type derivations, yielding a polynomial reasonable cost model for bounded depth.
citing papers explorer
-
Fine-Grained Bounds for Courcelle's Theorem
Proves fine-grained nearly ETH-tight bounds for Courcelle's theorem depending on treewidth t and the number of first-order and second-order variables in each quantifier alternation block of the MSO formula.