Pages that link to "Item:Q556911"
From MaRDI portal
The following pages link to Estimation of certain exponential sums arising in complexity theory (Q556911):
Displaying 15 items.
- Correlation lower bounds from correlation upper bounds (Q280948) (← links)
- On the correlation between parity and modular polynomials (Q692898) (← links)
- Incomplete quadratic exponential sums in several variables (Q817737) (← links)
- Uniqueness of optimal mod 3 polynomials for parity (Q962998) (← links)
- Learning read-constant polynomials of constant degree modulo composites (Q2254504) (← links)
- Block-symmetric polynomials correlate with parity better than symmetric (Q2410677) (← links)
- Bounds on an exponential sum arising in Boolean circuit complexity (Q2565522) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- (Q5077146) (← links)
- (Q5121894) (← links)
- (Q5875501) (← links)
- Monomial Boolean functions with large high-order nonlinearities (Q6204170) (← links)
