Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > BRUNO PASQUALOTTO CAVALAR:
All reports by Author Bruno Pasqualotto Cavalar:

TR20-181 | 4th December 2020
Bruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman

Monotone Circuit Lower Bounds from Robust Sunflowers

Revisions: 1

Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity, DNF sparsification, randomness extractors, and recent advances on the Erd\H{o}s-Rado sunflower conjecture. The recent breakthrough of Alweiss, Lovett, Wu and Zhang gives an improved bound on the maximum size of a $w$-set system that excludes ... more >>>




ISSN 1433-8092 | Imprint