Briggs; Henson; McCormick ( SDD Systems Solvers)

From Algorithm Wiki
Revision as of 07:56, 10 April 2023 by Admin (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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