Explicit exponential lower bounds for exact hyperplane covers

DOI10.1016/j.disc.2022.113114OpenAlexW3215391620WikidataQ115577226 ScholiaQ115577226MaRDI QIDQ2166321

Amir Yehudayoff, Benjamin E. Diamond

Publication date: 24 August 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113114

zbMATH Keywords

lower boundscommunication complexityexact hyperplane covers

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Theory of computing (68Qxx) Designs and configurations (05Bxx)

Related Items

Covering almost all the layers of the hypercube with multiplicities

Cites Work

• Solution of the Littlewood-Offord problem in high dimensions
• On the distributional complexity of disjointness
• Covering the cube by affine hyperplanes
• Exact hyperplane covers for subsets of the hypercube
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On the distribution of sums of residues
• Communication Complexity
• On a lemma of Littlewood and Offord
• Unnamed Item
• Unnamed Item