Reduction from All-Integers 3SUM to 3SUM

From Algorithm Wiki
Revision as of 10:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: All-Integers 3SUM TO: 3SUM == Description == == Implications == if: to-time: $O(n^{2-\epsilon})$ for some $\epsilon > {0}$<br/>then: from-time: $O(n^{1.5} + n^{2-\epsilon / 2})$ == Year == 2018 == Reference == V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018. https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 8.1")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

FROM: All-Integers 3SUM TO: 3SUM

Description

Implications

if: to-time: $O(n^{2-\epsilon})$ for some $\epsilon > {0}$
then: from-time: $O(n^{1.5} + n^{2-\epsilon / 2})$

Year

2018

Reference

V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018.

https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 8.1