Kelner; Orecchia; Sidford; Zhu (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(m log^{2} (n)$ | $O(m \log^{2} (n)$ \log \log n) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(m \log^{2} (n)$ \log \log n)
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