Sunflowers and robust sunflowers from randomness extractors

DOI10.4086/TOC.2022.V018A002MaRDI QIDQ5028366zbMATH OpenOpenAlexFDO

Authors Shachar Lovett, Jiapeng Zhang, Xin Li

Publication date 9 February 2022

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2022.v018a002

zbMATH Keywords

combinatoricsextractorssunflowersCNF-DNF formulas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Ramsey theory (05D10) Theory of computing (68Qxx)

Recommendations

• Sunflowers and quasi-sunflowers from randomness extractors
• Improved bounds for the sunflower lemma
• Improved bounds for the sunflower lemma
• Sunflowers: from soil to oil
• Sunflowers in set systems of bounded dimension

Cites work

• Improved non-malleable extractors, non-malleable codes and independent source extractors

This page was built for publication: Sunflowers and robust sunflowers from randomness extractors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028366)