Bareiss algorithm with fast multiplication (Determinant of Matrices with Integer Entries Determinant of Matrices with Integer Entries): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 12:1712:17, 15 February 2023‎ Admin talk contribs‎ 407 bytes +407‎ 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 == -"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Bareiss_algorithm_with_fast_multiplication_(Determinant_of_Matrices_with_Integer_Entries_Determinant_of_Matrices_with_Integer_Entries)"