Timeline for Longest double increasing subsequence (LIS variant)
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2020 at 4:37 | comment | added | Zachary Vance | Are the $p_i$ required to be distinct? I assume so. | |
| Oct 19, 2016 at 3:30 | answer | added | BlankVerse | timeline score: 1 | |
| Apr 7, 2016 at 16:21 | comment | added | Musa Al-hassy | You say you've "ran the algorithm" and are looking for a "recursive formula", if you provide the algorithm code explicitly, perhaps we can be of use in providing the formula ;) | |
| Feb 19, 2016 at 12:42 | comment | added | Raphael | Do you have any specific question about either 1) or 2)? As it is, your post is a status report, not a question. What have you tried towards a recursive formulation and a correctness proof? | |
| Feb 19, 2016 at 12:41 | comment | added | Raphael | @YuvalFilmus The OP has already identified that he's missing a recursive formulation and correctness proof. | |
| Feb 19, 2016 at 12:41 | history | edited | Raphael |
edited tags
|
|
| Feb 19, 2016 at 12:25 | comment | added | Yuval Filmus | If you're not sure that your solution works, prove that it does. That's the best way to know for sure. | |
| Feb 19, 2016 at 11:47 | history | asked | sel | CC BY-SA 3.0 |