A Simple Proof of Bazzi’s Theorem
From MaRDI portal
Publication:2947540
DOI10.1145/1490270.1490273zbMath1322.68108OpenAlexW2109322425MaRDI QIDQ2947540
Publication date: 24 September 2015
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1490270.1490273
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (12)
Fooling Polytopes ⋮ DNF sparsification and a faster deterministic counting algorithm ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Unnamed Item ⋮ The work of Mark Braverman ⋮ Bounded Independence Plus Noise Fools Products ⋮ Small-bias is not enough to hit read-once CNF ⋮ Bounded-depth circuits cannot sample good codes ⋮ Unnamed Item ⋮ Near-optimal pseudorandom generators for constant-depth read-once formulas ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets
This page was built for publication: A Simple Proof of Bazzi’s Theorem
