All Pairs Shortest Paths Hypothesis (APSP Hypothesis): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3010:30, 15 February 2023‎ Admin talk contribs‎ 517 bytes +517‎ Created page with "== Target Problem == APSP == Description == No randomized algorithm can solve APSP in $O(n^{3-\epsilon})$ time for $\epsilon > 0$ on $n$ node graphs with edge weights in $\{-n^c,\ldots,n^c\}$ and no negative cycles for large enough $c$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csa..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/All_Pairs_Shortest_Paths_Hypothesis_(APSP_Hypothesis)"