Parameterized circuit complexity of model checking first-order logic on sparse structures

Abstract

We prove that for every class $C$ of graphs with effectively bounded expansion, given a first-order sentence $\phi$ and an $n$-element structure $\mathbb{A}$ whose Gaifman graph belongs to $C$, the question whether $\phi$ holds in $\mathbb{A}$ can be decided by a family of AC-circuits of size $f(\phi )\cdot n^c$ and depth $f(\phi )+c\log n$, where $f$ is a computable function and $c$ is a universal constant. This places the model-checking problem for classes of bounded expansion in the parameterized circuit complexity class $para-A{C}^1$. On the route to our result we prove that the basic decomposition toolbox for classes of bounded expansion, including orderings with bounded weak coloring numbers and low treedepth decompositions, can be computed in $para-A{C}^1$.