The correlation between parity and quadratic polynomials mod \(3\) (Q1881261): Difference between revisions

@@ Property / cites work @@
+Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Complex polynomials and circuit lower bounds for modular counting
+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 @@
+With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
+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 @@
+A note on the power of majority gates and modular gates
+Normal rank
@@ Property / cites work @@
+Exponential sums and circuits with a single threshold gate and mod-gates
+Normal rank
@@ Property / cites work @@
+A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
+Normal rank
@@ Property / cites work @@
+The power of the middle bit of a \(\#\)P function
@@ Property / cites work: The power of the middle bit of a \(\#\)P function / rank @@
+Normal rank
@@ Property / cites work @@
+A weight-size trade-off for circuits with MOD m gates
+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 @@
+Q3216750
@@ Property / cites work: Q3216750 / rank @@
+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 @@
+Natural proofs
@@ Property / cites work: Natural proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Equations over finite fields. An elementary approach
+Normal rank
@@ Property / cites work @@
+PP is as Hard as the Polynomial-Time Hierarchy
@@ Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank @@
+Normal rank