Larmore (Approximate OBST Optimal Binary Search Trees)

From Algorithm Wiki

Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.6})$ == Space Complexity == $O(n)$ (Derived: Computing and storing f_{d,l} for each n elements) == Description == == Approximate? == Approximate Approximation Factor: \epsilon = o(1) == Randomized? == No, deterministic == Model of Computation == == Year == 1987 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677487900526")

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

Jump to navigation Jump to search

Time Complexity

$O(n^{1.6})$

Space Complexity

$O(n)$

(Derived: Computing and storing f_{d,l} for each n elements)

Description

Approximate?

Approximate

Approximation Factor: \epsilon = o(1)

Randomized?

No, deterministic

Model of Computation

Year

1987

Reference

https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/0196677487900526

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Larmore_(Approximate_OBST_Optimal_Binary_Search_Trees)&oldid=44353"