Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers): Revision history

3 May 2023

• curprev 12:1912:19, 3 May 2023‎ Admin talk contribs‎ 444 bytes 0‎ No edit summary Tag: Manual revert
• curprev 12:1912:19, 3 May 2023‎ Admin talk contribs‎ 444 bytes 0‎ No edit summary Tags: Manual revert Reverted

28 April 2023

• curprev 10:2910:29, 28 April 2023‎ Admin talk contribs‎ 444 bytes 0‎ No edit summary Tag: Manual revert
• curprev 10:2910:29, 28 April 2023‎ Admin talk contribs‎ 444 bytes 0‎ No edit summary Tags: Manual revert Reverted

10 April 2023

• curprev 08:5608:56, 10 April 2023‎ Admin talk contribs‎ 444 bytes 0‎ No edit summary
• curprev 08:5608:56, 10 April 2023‎ Admin talk contribs‎ 444 bytes +1‎ No edit summary

15 February 2023

• curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 443 bytes 0‎ No edit summary

• curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 443 bytes +443‎ 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"