Briggs; Henson; McCormick ( SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{1.{2}5} loglogn)$ == 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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{1.{2}5} | $O(n^{1.{2}5} \log \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:56, 10 April 2023
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