Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth

DOI10.1145/3209108.3209179zbMATH Open1497.68225arXiv1710.01934OpenAlexW2963145533MaRDI QIDQ5145309FDOQ5145309

Arnaud Durand, Heribert Vollmer, Anselm Haak

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: In this paper we give a characterization of both Boolean and arithmetic circuit classes of logarithmic depth in the vein of descriptive complexity theory, i.e., the Boolean classes

e x t r m {N C}^{1}

,

e x t r m {S A C}^{1}

and

e x t r m {A C}^{1}

as well as their arithmetic counterparts

,

and

. We build on Immerman's characterization of constant-depth polynomial-size circuits by formulas of first-order logic, i.e.,

e x t r m {A C}^{0} = e x t r m F O

, and augment the logical language with an operator for defining relations in an inductive way. Considering slight variations of the new operator, we obtain uniform characterizations of the three just mentioned Boolean classes. The arithmetic classes can then be characterized by functions counting winning strategies in semantic games for formulas characterizing languages in the corresponding Boolean class.

Full work available at URL: https://arxiv.org/abs/1710.01934

zbMATH Keywords

finite model theory arithmetic circuits descriptive complexity counting classes

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19) Networks and circuits as models of computation; circuit complexity (68Q06)

Cited In (4)

This page was built for publication: Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth

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