All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:55, 15 February 2023 Admin talk contribs created page Reduction from Negative Triangle Detection to All-Nodes Median Parity (Created page with "FROM: Negative Triangle Detection TO: All-Nodes Median Parity == Description == == Implications == if: to-time: $\tilde{O}(T(n,M))$ for $n$-node $m$-edge graph with integer weights in $(-M, M)$<br/>then: from-time: $\tilde{O}T(n,M))$ == Year == 2015 == Reference == Amir Abboud, Fabrizio Grandoni, and Virginia Vassilevska Williams. Subcubic equivalences between graph centrality problems, APSP and diameter. In Proceedings of the Twenty-Sixth Annual ACM...")