Knuth's DP algorithm (OBST Optimal Binary Search Trees)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3})$
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