Bunch; Hopcroft (Square Matrix LU Decomposition LU Decomposition)
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://dl.acm.org/citation.cfm?id=248979")
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