Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947): Difference between revisions

@@ Property / cites work @@
+Depth reduction for circuits of unbounded fan-in
@@ Property / cites work: Depth reduction for circuits of unbounded fan-in / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for modular counting by circuits with modular gates
+Normal rank
@@ Property / cites work @@
+Non-uniform automata over groups
@@ Property / cites work: Non-uniform automata over groups / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for some depth-3 circuit classes
+Normal rank
@@ Property / cites work @@
+On ACC
@@ Property / cites work: On ACC / rank @@
+Normal rank
@@ Property / cites work @@
+Q4246733
@@ Property / cites work: Q4246733 / rank @@
+Normal rank
@@ Property / cites work @@
+Harmonic Analysis of Polynomial Threshold Functions
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the power of majority gates and modular gates
+Normal rank
@@ Property / cites work @@
+A weight-size trade-off for circuits with MOD m gates
+Normal rank
@@ Property / cites work @@
+Lower Bounds for (MOD<i><sub>p</sub></i> - MOD<i><sub>m</sub></i>) Circuits
+Normal rank
@@ Property / cites work @@
+On the power of small-depth threshold circuits
@@ Property / cites work: On the power of small-depth threshold circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On Graph Complexity
@@ Property / cites work: On Graph Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of depth-2 circuits with threshold and modulo gates
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank
@@ Property / cites work @@
+A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
+Normal rank
@@ Property / cites work @@
+Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates
+Normal rank