scientific article; zbMATH DE number 7471590

DOI10.4086/TOC.2022.V018A002OpenAlexW4225525545MaRDI QIDQ5028366FDOQ5028366

Xin Li, Shachar Lovett, Jiapeng Zhang

Publication date: 9 February 2022

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

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

Title of this publication is not available (Why is that?)

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)

Cites Work

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

This page was built for publication:

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