Bringmann, Karl Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Fischer, Nick Algorithms and Complexity, MPI for Informatics, Max Planck Society;
3564246.fm-1.pdf (Publisher version), 2MB
Abboud, A., Bringmann, K., & Fischer, N. (2023). Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. In B. Saha, & R. A. Servedio (Eds.), STOC '23 (pp. 391-404). New York, NY: ACM. doi:10.1145/3564246.3585240.