On the size of depth-two threshold circuits for the inner product mod 2 function
From MaRDI portal
(Redirected from Publication:782579)
Recommendations
- On the computational power of depth-2 circuits with threshold and modulo gates
- Mathematical Foundations of Computer Science 2005
- On Optimal Depth Threshold Circuits for Multiplication and Related Problems
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- On realizing iterated multiplication by small depth threshold circuits
- Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
- On complexity of linear operators on the class of circuits of depth 2
- On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2
- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
Cited in
(8)- On the computational power of depth-2 circuits with threshold and modulo gates
- Lower bounds for linear decision trees with bounded weights
- \(\mathrm{AC}^0\circ\mathrm{MOD}_2\) lower bounds for the Boolean inner product
- On realizing iterated multiplication by small depth threshold circuits
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product
- Mathematical Foundations of Computer Science 2005
- On Blocky Ranks Of Matrices
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity
This page was built for publication: On the size of depth-two threshold circuits for the inner product mod 2 function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782579)
