Matrix inverse (General Linear system of equations)
Jump to navigation
Jump to search
Time Complexity
$O(n^omega)$ where omega is the exponent on the complexity of matrix multiplication;
currently $O(n^{2.37285956})$
Space Complexity
$O(n^{2})$ words
(equivalent to matrix multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM