New bounds for matching vector families

DOI10.1145/2488608.2488713zbMath1293.90003arXiv1204.1367OpenAlexW2094578740MaRDI QIDQ5495853

Shachar Lovett, Zeev Dvir, Abhishek Bhowmick

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1367

zbMATH Keywords

restricted modular intersection

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Unnamed Item ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ A generalization of a theorem of Rothschild and van Lint ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity

This page was built for publication: New bounds for matching vector families