Timeline for Reconstructing an ordering of a multiset from its consecutive submultisets
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 19, 2010 at 15:37 | comment | added | Rob Grey | And please note that I still need to take time to think about Steve Huntsman's answer. | |
| Jan 19, 2010 at 15:34 | comment | added | Rob Grey | Dear Qiaochu, I don't expect every sequence to be perfectly reconstructible given arbitrary computational resources and you make a good point about the palindromic sandwiches. "Perhaps you want instead an algorithm that generates all possible orderings?" - Yes, it would be terrific to have an efficient algorithm to enumerate all 'legal' orderings so that probabilities could be assigned to them, or at least to see the growth in the number of orderings as a function of (t, r, j, p). | |
| Jan 19, 2010 at 15:10 | history | answered | Qiaochu Yuan | CC BY-SA 2.5 |