The complexity of subcube partition relates to the additive structure of the support
From MaRDI portal
Publication:6559026
DOI10.1016/J.IC.2024.105170MaRDI QIDQ6559026
Publication date: 21 June 2024
Published in: (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Upper bounds on Fourier entropy
- On the construction of affine extractors
- Explicit constructions of extractors and expanders
- Approximation of biased Boolean functions of small total influence by DNFs
- Analysis of Boolean Functions
- A necessary condition on minimal cube numberings
This page was built for publication: The complexity of subcube partition relates to the additive structure of the support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559026)
