Back to Results
First PageMeta Content
Dynamic programming / Operations research / NP-complete problems / Combinatorial optimization / Mathematical optimization / Knapsack problem / Greedy algorithm / Algorithm / Overlapping subproblems / Mathematics / Applied mathematics / Theoretical computer science


Dynamic Programming vs. Divide-&-conquer •
Add to Reading List

Document Date: 2007-11-01 16:16:04

Open Document

File Size: 391,95 KB

Share Result on Facebook
UPDATE