Larmore (Approximate OBST Optimal Binary Search Trees): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3110:31, 15 February 2023‎ Admin talk contribs‎ 402 bytes +402‎ 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"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Larmore_(Approximate_OBST_Optimal_Binary_Search_Trees)"