Bareiss Algorithm (Toeplitz Matrix Linear System)

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ total words

(can be easily derived (lower bounded by input size, upper bounded by runtime))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1969

Reference

https://link.springer.com/article/10.1007/BF02163269