The following pages link to A Simple Proof of Bazzi’s Theorem (Q2947540):
Displaying 11 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Small-bias is not enough to hit read-once CNF (Q519906) (← links)
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- Fooling Polytopes (Q5066946) (← links)
- (Q5077146) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- (Q5875501) (← links)
- The work of Mark Braverman (Q6200321) (← links)
