All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 12:15, 15 February 2023 Admin talk contribs created page Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers) (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")