Timeline for Sequence with upper-bounded distance between same element
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2017 at 4:33 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
added 2 characters in body
|
| Mar 19, 2017 at 4:27 | history | edited | Gerhard Paseman | CC BY-SA 3.0 |
edited body
|
| Mar 19, 2017 at 4:26 | comment | added | Gerhard Paseman | There are ways to make things more efficient. For example, you can build a library of acceptable sequences of length 2k by concatenating and testing entries from a library of length k sequences with each other. However people who do string processing may know of better ways, and your problem might have been encountered in the computer science literature. Gerhard "So Many Words To Join" Paseman, 2017.03.18. | |
| Mar 19, 2017 at 4:20 | history | answered | Gerhard Paseman | CC BY-SA 3.0 |