Bounded depth arithmetic circuits: Counting and closure
From MaRDI portal
Recommendations
Cited in
(18)- Circuits in bounded arithmetic. I
- Semantical counting circuits
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- On the complexity of matrix rank and rigidity
- On the power of algebraic branching programs of width two
- On the power of algebraic branching programs of width two
- Functions definable by arithmetic circuits
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae
- Resource trade-offs in syntactically multilinear arithmetic circuits
- On counting AC^0 circuits with negative constants
- Semantical counting circuits
- Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth
- The limits of depth reduction for arithmetic formulas
- Descriptive complexity of \#AC\(^0\) functions
- Mathematical Foundations of Computer Science 2003
- scientific article; zbMATH DE number 2196509 (Why is no real title available?)
- Parameterised counting in logspace
This page was built for publication: Bounded depth arithmetic circuits: Counting and closure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938621)