Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive 
Combinatorics

Abboud, Amir; Bringmann, Karl; Fischer, Nick

doi:10.1145/3564246.3585240

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer, Nick
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

3564246.fm-1.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

Cite as: https://hdl.handle.net/21.11116/0000-000C-8C13-1

Abstract

There is no abstract available