Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities


Journal article


Joshua Brakensiek, Yeyuan Chen, Manik Dhar, Zihan Zhang,
To Appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States, 2026

ACM STOC 2026 Arxiv
Cite

Cite

APA   Click to copy
Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. (2026). To Appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States.


Chicago/Turabian   Click to copy
“Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities.” To Appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States (2026).


MLA   Click to copy
“Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities.” To Appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States, 2026.


BibTeX   Click to copy

@article{joshua2026a,
  title = {Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities},
  year = {2026},
  journal = {To Appear at the 57th Annual ACM Symposium on Theory of Computing (STOC 2026), Salt Lake City, United States},
  author = {}
}