Bjorck (2-D Polynomial Interpolation Polynomial Interpolation)
Revision as of 12: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/imajna/article/8/4/473/758789?login=true) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1970 == Reference == https://www.jstor.org/stable/2004623?origin=crossref&seq=5#metadata_info_tab_contents")
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$ words
(https://academic.oup.com/imajna/article/8/4/473/758789?login=true)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1970
Reference
https://www.jstor.org/stable/2004623?origin=crossref&seq=5#metadata_info_tab_contents