Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
From MaRDI portal
Publication:3392947
Recommendations
- Lower bounds for modular counting by circuits with modular gates
- Lower bounds for modular counting by circuits with modular gates
- Depth reduction for circuits of unbounded fan-in
- On the computational power of depth 2 circuits with threshold and modulo gates
- On the computational power of depth-2 circuits with threshold and modulo gates
Cites work
- scientific article; zbMATH DE number 1301088 (Why is no real title available?)
- A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
- A note on the power of majority gates and modular gates
- A weight-size trade-off for circuits with MOD \(m\) gates
- Automata, Languages and Programming
- Depth reduction for circuits of unbounded fan-in
- Harmonic Analysis of Polynomial Threshold Functions
- Lower Bounds for (MODp - MODm) Circuits
- Lower bounds for modular counting by circuits with modular gates
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- NP is as easy as detecting unique solutions
- Non-uniform automata over groups
- On ACC
- On Graph Complexity
- On the computational power of depth-2 circuits with threshold and modulo gates
- On the power of small-depth threshold circuits
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
- Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
- Upper and lower bounds for some depth-3 circuit classes
Cited in
(4)
This page was built for publication: Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392947)
