Timeline for Finding longest balanced parentheses using $n$ smaller strings
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2017 at 23:04 | comment | added | cave_93 | Thanks for the answer, unfortunately this is still exponential. I need something that takes $O(n^3)$ max. Maybe the representation that you mentioned can be used to implement a dynamic programming solution instead of a graph search somehow? | |
| Apr 17, 2017 at 6:35 | history | answered | D.W.♦ | CC BY-SA 3.0 |