Pages that link to "Item:Q2565522"
From MaRDI portal
The following pages link to Bounds on an exponential sum arising in Boolean circuit complexity (Q2565522):
Displayed 6 items.
- Correlation lower bounds from correlation upper bounds (Q280948) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Uniqueness of optimal mod 3 polynomials for parity (Q962998) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- Monomial Boolean functions with large high-order nonlinearities (Q6204170) (← links)