NP is as easy as detecting unique solutions
Theoretical Computer Science
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Non-uniform automata over groups
Information and Computation
Probabilistic polynomials, AC0 functions and the polynomial-time hierarchy
STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Depth reduction for circuits of unbounded fan-in
Information and Computation
A weight-size trade-off for circuits with MOD m gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A note on the power of majority gates and modular gates
Information Processing Letters
Computational Complexity - Special issue on circuit complexity
On the computational power of depth-2 circuits with threshold and modulo gates
Theoretical Computer Science
Upper and lower bounds for some depth-3 circuit classes
Computational Complexity
Lower Bounds for (MODp - MODm) Circuits
SIAM Journal on Computing
Lower bounds for modular counting by circuits with modular gates
Computational Complexity
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
A Note on MODp - MODm Circuits
Theory of Computing Systems
Lower bounds for circuits with MOD_m gates
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Combinatorics, Probability and Computing
Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates
SIAM Journal on Computing
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Lower bounds for circuits with few modular and symmetric gates
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Weights of exact threshold functions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
| Hi-index | 0.00 |
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e ${\bf AC}^{0} \circ {\bf MOD}_m$ circuits. We show that the following holds for several types of gates $\mathcal{G}$: by adding a gate of type $\mathcal{G}$ at the output, it is possible to obtain an equivalent probabilistic depth 2 circuit of quasipolynomial size consisting of a gate of type $\mathcal{G}$ at the output and a layer of modular counting gates, i.e $\mathcal{G} \circ {\bf MOD}_m$ circuits. The types of gates $\mathcal{G}$ we consider are modular counting gates and threshold-style gates. For all of these, strong lower bounds are known for (deterministic) $\mathcal{G} \circ {\bf MOD}_m$ circuits.