Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV

Author(s)
Chan, Timothy; Vassilevska Williams, Virginia; Xu, Yinzhan
Thumbnail
Download3519935.3520032.pdf (786.5Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Date issued
2022-06-09
URI
https://hdl.handle.net/1721.1/146418
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
Chan, Timothy, Vassilevska Williams, Virginia and Xu, Yinzhan. 2022. "Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV."
Version: Final published version
ISBN
978-1-4503-9264-8
Collections