Asymptotically fast Toeplitz algorithms (Toeplitz Linear system of equations)

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n*log^{2}(n)$) == Space Complexity == $O(n*log^{2}(n)$)? words (upper bound) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008? == Reference == https://epubs.siam.org/doi/10.1137/040617200")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n*log^{2}(n)$)

Space Complexity

$O(n*log^{2}(n)$)? words

(upper bound)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2008?

Reference

https://epubs.siam.org/doi/10.1137/040617200

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Asymptotically_fast_Toeplitz_algorithms_(Toeplitz_Linear_system_of_equations)&oldid=45058"