Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
Name
3564246.3585237.pdf
Size
329.72 KB
Format
Adobe PDF
Checksum (MD5)
571c07495f2044438956072bca7c6c3c
Author(s)
Chan, Timothy M.
Vassilevska Williams, Virginia
Xu, Yinzhan
Date Issued
June 2, 2023
Publisher
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Citation
Chan, Timothy M., Vassilevska Williams, Virginia and Xu, Yinzhan. 2023. "Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3564246.3585237
