Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers): 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.

10 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 426 bytes +426‎ Created page with "== Time Complexity == $O(m log^{2} (n)$ loglogn) == Space Complexity == $O(n)$ words (Derived: Uses a spanning tree of the graph that the Laplacian is for) == Description == Low-stretch spanning tree == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == https://arxiv.org/pdf/1301.6628.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Kelner;_Orecchia;_Sidford;_Zhu_(Inexact_Laplacian_Solver_SDD_Systems_Solvers)"