The following pages link to (Q3002796):
Displayed 19 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- A discrepancy lower bound for information complexity (Q343867) (← links)
- Limits of Boolean functions on \(\mathbb{F}_p^n\) (Q463037) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- Improved direct product theorems for randomized query complexity (Q693002) (← links)
- A note on the relation between XOR and selective XOR lemmas (Q2203599) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- On Yao’s XOR-Lemma (Q3088189) (← links)
- Interleaved Group Products (Q4634030) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- (Q5077146) (← links)
- (Q5875501) (← links)
- (Q6062153) (← links)
- Monomial Boolean functions with large high-order nonlinearities (Q6204170) (← links)