Higham (2-D Polynomial Interpolation Polynomial Interpolation)

From Algorithm Wiki

Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$ words (https://academic-oup-com.ezproxy.canberra.edu.au/imajna/article/8/4/473/758789?login=true) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1988 == Reference == https://academic-oup-com.ezproxy.canberra.edu.au/imajna/article/8/4/473/758789?login=true")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$ words

(https://academic-oup-com.ezproxy.canberra.edu.au/imajna/article/8/4/473/758789?login=true)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1988

Reference

https://academic-oup-com.ezproxy.canberra.edu.au/imajna/article/8/4/473/758789?login=true

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Higham_(2-D_Polynomial_Interpolation_Polynomial_Interpolation)&oldid=45577"