Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities | NSF Public Access Repository

skip to main content

An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Citation Details

This content will become publicly available on June 9, 2027

Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities

Award ID(s):: 2236931

PAR ID:: 10708722

Author(s) / Creator(s):: Brakensiek, Joshua; Chen, Yeyuan; Dhar, Manik; Zhang, Zihan

Publisher / Repository:: ACM

Date Published:: 2026-06-09

ISBN:: 9798400725364

Page Range / eLocation ID:: 365 to 376

Format(s):: Medium: X

Location:: Salt Lake City UT USA

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on June 9, 2027
Conference Paper:
https://doi.org/10.1145/3798129.3800756