Timeline for Reordering algorithm to fragment consecutive sequences of ones as much as possible
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9 at 21:18 | history | edited | Thedby | CC BY-SA 4.0 |
added 3 characters in body
|
| Apr 9 at 18:19 | history | edited | Thedby | CC BY-SA 4.0 |
added 2 characters in body
|
| Apr 9 at 18:12 | comment | added | Thedby | I've added an edit to explain where this problem comes from, thanks for your interest. | |
| Apr 9 at 17:02 | history | edited | Thedby | CC BY-SA 4.0 |
added 906 characters in body
|
| Apr 9 at 16:54 | answer | added | caduk | timeline score: 0 | |
| Apr 9 at 15:53 | comment | added | TonyK | It might help people (e.g. me) to visualise this better if you could provide some motivation or background for the problem. | |
| Apr 9 at 15:49 | comment | added | Thedby | Yes you are right. I edited the question. Thanks! | |
| Apr 9 at 15:47 | history | edited | Thedby | CC BY-SA 4.0 |
deleted 10 characters in body
|
| Apr 9 at 9:36 | comment | added | caduk | When you say "a maximal substring of S of equal consecutive elements", it appears from the example that it must be a chain of $1$'s but not of $0$'s. Correct? | |
| Apr 8 at 21:52 | history | edited | Thedby | CC BY-SA 4.0 |
added 24 characters in body
|
| S Apr 8 at 21:50 | review | First questions | |||
| Apr 8 at 22:18 | |||||
| S Apr 8 at 21:50 | history | asked | Thedby | CC BY-SA 4.0 |