Reduction from Negative Triangle Detection to Metricity

From Algorithm Wiki
Revision as of 10:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: Negative Triangle Detection TO: Metricity == Description == == Implications == if: to-time: $O(n^{2}) + T(O(n), O(M))$ where the metricity problem is on $(n)$ s.t. all distances are in $(-M, M)$, and $T(n,M)$ is nondecreasing<br/>then: from-time: $O(n^{2}) + T(O(n), O(M))$ == Year == 2018 == Reference == V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018. https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

FROM: Negative Triangle Detection TO: Metricity

Description

Implications

if: to-time: $O(n^{2}) + T(O(n), O(M))$ where the metricity problem is on $(n)$ s.t. all distances are in $(-M, M)$, and $T(n,M)$ is nondecreasing
then: from-time: $O(n^{2}) + T(O(n), O(M))$

Year

2018

Reference

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

https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.1145/3186893, Theorem 5.2