On the correlation between parity and modular polynomials (Q692898): Difference between revisions

@@ Property / cites work @@
+\(\Sigma_ 1^ 1\)-formulae on finite structures
@@ Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for some depth-3 circuit classes
+Normal rank
@@ Property / cites work @@
+Estimation of certain exponential sums arising in complexity theory
+Normal rank
@@ Property / cites work @@
+On the correlation of symmetric functions
@@ Property / cites work: On the correlation of symmetric functions / rank @@
+Normal rank
@@ Property / cites work @@
+Parity, circuits, and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Exponential sums and circuits with a single threshold gate and mod-gates
+Normal rank
@@ Property / cites work @@
+Bounds on an exponential sum arising in Boolean circuit complexity
+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 @@
+Threshold circuits of bounded depth
@@ Property / cites work: Threshold circuits of bounded depth / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+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 the computational power of depth 2 circuits with threshold and modulo gates
+Normal rank
@@ Property / cites work @@
+Q3765876
@@ Property / cites work: Q3765876 / rank @@
+Normal rank
@@ Property / cites work @@
+\(n^{{\Omega{}}(\log{} n)}\) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
+Normal rank
@@ Property / cites work @@
+Q3248055
@@ Property / cites work: Q3248055 / rank @@
+Normal rank