Brakensiek, J., Chen, Y., Dhar, M., & Zhang, Z. (2026). Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities. Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 365. https://doi.org/10.1145/3798129.3800756
Παραπομπή σε μορφή Chicago (17η εκδ.)Brakensiek, Joshua, Yeyuan Chen, Manik Dhar, και Zihan Zhang. "Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities." Proceedings of the 58th Annual ACM Symposium on Theory of Computing 2026: 365. https://doi.org/10.1145/3798129.3800756.
Παραπομπή σε μορφή MLA (9th εκδ.)Brakensiek, Joshua, et al. "Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities." Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026, p. 365, https://doi.org/10.1145/3798129.3800756.