Improved bounds for the sunflower lemma-Reference-Cited by-同舟云学术

Improved bounds for the sunflower lemma

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Alweiss Ryan¹,Lovett Shachar²,Wu Kewen³,Zhang Jiapeng⁴

Affiliation:

1. Princeton University, USA

2. University of California at San Diego, USA

3. Peking University, China

4. Harvard University, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384234

Reference40 articles.

1. Linear Circuits over GF(2);Alon Noga;SIAM J. Comput.,1990

2. Noga Alon Amir Shpilka and Christopher Umans. 2013. On sunflowers and matrix multiplication. Computational Complexity 22 2 ( 2013 ) 219-243. https: //doi.org/10.1007/s00037-013-0060-1 10.1007/s00037-013-0060-1 Noga Alon Amir Shpilka and Christopher Umans. 2013. On sunflowers and matrix multiplication. Computational Complexity 22 2 ( 2013 ) 219-243. https: //doi.org/10.1007/s00037-013-0060-1 10.1007/s00037-013-0060-1

3. Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains;Berkman Omer;Journal of Algorithms,1998

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong Bounds for 3-Progressions;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. On the size of maximal intersecting families;Combinatorics, Probability and Computing;2023-09-08

3. Spanning -cycles in random graphs;Combinatorics, Probability and Computing;2023-06-09

4. A smoother notion of spread hypergraphs;Combinatorics, Probability and Computing;2023-06-08

5. On t-Intersecting Hypergraphs with Minimum Positive Codegrees;SIAM Journal on Discrete Mathematics;2023-05-26