Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $\tilde{O}(m log n)$ == Space Complexity == $O(n)$ words (Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree) == Description == Incremental sparsifier == Approximate? == Approximate Approximation Factor: \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2010 == Reference == https://arxiv.org/abs/1102.4842") |
No edit summary Tag: Manual revert |
||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$\tilde{O}(m log n)$ | $\tilde{O}(m \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 29: | Line 29: | ||
== Year == | == Year == | ||
2011 | |||
== Reference == | == Reference == | ||
https://arxiv.org/abs/ | https://arxiv.org/abs/1003.2958 | ||
Latest revision as of 11:19, 3 May 2023
Time Complexity
$\tilde{O}(m \log n)$
Space Complexity
$O(n)$ words
(Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree)
Description
Incremental sparsifier
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2011