Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth

DOI10.1145/3209108.3209179MaRDI QIDQ5145309zbMATH OpenOpenAlexFDO

Authors Arnaud Durand, Anselm Haak, Heribert Vollmer

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)

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

zbMATH Keywords

arithmetic circuitscounting classesdescriptive complexityfinite model theory

Mathematics Subject Classification ID

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

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 $extrm{NC}^1$, $extrm{SAC}^1$ and $extrm{AC}^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., $extrm{AC}^0=extrmFO$, 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.

Recommendations

• scientific article; zbMATH DE number 806747
• scientific article; zbMATH DE number 1405642
• Mathematical Foundations of Computer Science 2003

Cited in

(9)

• Recursion schemata for slowly growing depth circuit classes
• A logical characterization of constant-depth circuits over the reals
• Descriptive complexity of \#P functions: a new perspective
• scientific article; zbMATH DE number 806747 (Why is no real title available?)
• Counting of Teams in First-Order Team Logics
• Logical characterizations of algebraic circuit classes over integral domains
• Counting of teams in first-order team logics
• A logical characterization of constant-depth circuits over the reals
• Characterizing small circuit classes from FAC^0 to FAC^1 via discrete ordinary differential equations

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)