Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dynamic-programming
Search options not deleted
user 105447
Questions about problems that can be solved by combining recursively obtained solutions of subproblems.
1
vote
Word factorization in $O(n^2 \log n)$ time
If I'm not misunderstanding you, I think the minimum cost factorization can be calculated in $O(n^2)$ time as follows.
For each index i, we will calculate a bunch of values $(p_i^\ell, r_i^\ell)$ for …
- 131