Pages that link to "Item:Q1590080"
From MaRDI portal
The following pages link to A complex-number Fourier technique for lower bounds on the mod-\(m\) degree (Q1590080):
Displaying 13 items.
- Constructing Ramsey graphs from Boolean function representations (Q397068) (← links)
- Characterization of robust immune symmetric Boolean functions (Q892387) (← links)
- On mod \(p\) transversals (Q1180406) (← links)
- A lower bound on the MOD 6 degree of the OR function (Q1272657) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Covering symmetric sets of the Boolean cube by affine hyperplanes (Q2138580) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- Parity helps to compute majority (Q5091774) (← links)
