Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV
Name
3519935.3520032.pdf
Size
786.57 KB
Format
Adobe PDF
Checksum (MD5)
6ca02157c30f21f9ac102d5062b07188
Author(s)
Chan, Timothy
Vassilevska Williams, Virginia
Xu, Yinzhan
Date Issued
June 9, 2022
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
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3519935.3520032
