Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{4}L(log(n)$ + L)log(log(n) + L)) == Space Complexity == $O(n^{2}(n*log(n)$+nL)) bits (Keeps track of $O(n^2)$ entries that have absolute value at most $O(n^{(n/2)}2^{(nL)})$) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? (without O(1) multiplication) == Year == 1968 == Reference == -") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{4}L(log(n)$ + L)log(log(n) + L)) | $O(n^{4} L (\log(n)$ + L) \log(\log(n) + L)) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:50, 10 April 2023
Time Complexity
$O(n^{4} L (\log(n)$ + L) \log(\log(n) + L))
Space Complexity
$O(n^{2}(n*log(n)$+nL)) bits
(Keeps track of $O(n^2)$ entries that have absolute value at most $O(n^{(n/2)}2^{(nL)})$)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM? (without O(1) multiplication)
Year
1968
Reference
-