Naive Implementation (Exact Laplacian Solver SDD Systems Solvers)
Jump to navigation
Jump to search
Time Complexity
$O(n!)$
Space Complexity
$O(n^{2})$ Word RAM
(Derived: The Leibniz formula for the determinant of the Laplacian can be computed with constant space. The adjugate matrix of the Laplacian takes $n^2$ space.)
Description
Explicitly calculating the inverse of the Laplacian to solve for x
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1940
Reference
-