Briggs; Henson; McCormick ( SDD Systems Solvers)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{1.{2}5} \log \log n)$

Space Complexity

()

Description

Multigrid

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2000

Reference

http://www.math.ust.hk/~mamu/courses/531/tutorial_with_corrections.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Briggs;_Henson;_McCormick_(_SDD_Systems_Solvers)&oldid=47024"