Related references
Note: Only part of the references are listed.Note on sunflowers
Tolson Bell et al.
DISCRETE MATHEMATICS (2021)
Improved Bounds for the Sunflower Lemma
Ryan Alweiss et al.
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20) (2020)
DNF Sparsification beyond Sunflowers
Shachar Lovett et al.
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19) (2019)
Separating Monotone VP and VNP
Amir Yehudayoff
PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19) (2019)
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet
Gil Cohen et al.
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2018)
Strongly Exponential Lower Bounds for Monotone Computation
Toniann Pitassi et al.
STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2017)
THE MONOTONE COMPLEXITY OF k-CLIQUE ON RANDOM GRAPHS
Benjamin Rossman
SIAM JOURNAL ON COMPUTING (2014)
DNF sparsification and a faster deterministic counting algorithm
Parikshit Gopalan et al.
COMPUTATIONAL COMPLEXITY (2013)
A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
S. B. Gashkov et al.
SBORNIK MATHEMATICS (2012)
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
Ran Raz et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2011)
Share Paper
