Modified Knuth's DP algorithm (OBST Optimal Binary Search Trees)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4492658) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://www.cs.bgu.ac.il/~michaluz/seminar/Knuth71.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4492658)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

https://www.cs.bgu.ac.il/~michaluz/seminar/Knuth71.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Modified_Knuth%27s_DP_algorithm_(OBST_Optimal_Binary_Search_Trees)&oldid=45301"