Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2.{37}6})$
Space Complexity
$\tilde{O}(n^{2})$ words
(Derived: Uses Strassen multiplication and a constant number of $n \times n$ auxiliary matrices)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1974