Determinant of Matrices with Integer Entries: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
Line 22: Line 22:
|}
|}


== Time Complexity graph ==  
== Time Complexity Graph ==  


[[File:Determinant of Matrices with Integer Entries - Time.png|1000px]]
[[File:Determinant of Matrices with Integer Entries - Time.png|1000px]]


== Space Complexity graph ==  
== Space Complexity Graph ==  


[[File:Determinant of Matrices with Integer Entries - Space.png|1000px]]
[[File:Determinant of Matrices with Integer Entries - Space.png|1000px]]


== Pareto Decades graph ==  
== Pareto Frontier Improvements Graph ==  


[[File:Determinant of Matrices with Integer Entries - Pareto Frontier.png|1000px]]
[[File:Determinant of Matrices with Integer Entries - Pareto Frontier.png|1000px]]

Revision as of 14:05, 15 February 2023

Description

Calculate the determinant of a given matrix with integer matrices. For such matrices, the determinant is also an integer.

Parameters

n: dimension of matrix

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Bareiss algorithm 1968 $O(n^{5}L^{2} (log(n)$^{2} + L^{2})) $O(n^{2}(n*log(n)$+nL)) Exact Deterministic Time
Bareiss algorithm with fast multiplication 1968 $O(n^{4}L(log(n)$ + L)log(log(n) + L)) $O(n^{2}(n*log(n)$+nL)) Exact Deterministic

Time Complexity Graph

Determinant of Matrices with Integer Entries - Time.png

Space Complexity Graph

Determinant of Matrices with Integer Entries - Space.png

Pareto Frontier Improvements Graph

Determinant of Matrices with Integer Entries - Pareto Frontier.png