Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV

Timothy M. Chan, Virginia Vassilevska Williams, Yinzhan Xu. Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 1501-1514, ACM, 2022. [doi]

Abstract

Abstract is missing.