Karpinski (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 11:3111:31, 15 February 2023‎ Admin talk contribs‎ 433 bytes +433‎ Created page with "== Time Complexity == $O(n^{0.6})$ == Space Complexity == $O({1})$ (Derived: dynamic programming and making use of Monge matrix properties) == Description == == Approximate? == Approximate Approximation Factor: \epsilon = o(1) == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.54.6940&rep=rep1&type=pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Karpinski_(Approximate_OBST_Optimal_Binary_Search_Trees)"