Timeline for Efficient implementation of a linear complexity measure of binary sequences
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 14, 2013 at 13:51 | comment | added | Daniel Lichtblau | Keep in mind though that the same ideas could be applied to C code from @Leonid and Stefan. That could give another factor of 10 improvement. | |
| Mar 14, 2013 at 7:01 | comment | added | Rainer | Dear Daniel, this is exactly what I was looking for thanks for sharing the code, this will help a lot. @Leonid & Stefan and all the rest of the lot which added comments in this post: I really had a lot of fun reading all of your inputs on this question. You are all awesome! | |
| Mar 14, 2013 at 6:58 | vote | accept | Rainer | ||
| Mar 14, 2013 at 6:58 | vote | accept | Rainer | ||
| Mar 14, 2013 at 6:58 | |||||
| Mar 13, 2013 at 21:40 | history | edited | Daniel Lichtblau | CC BY-SA 3.0 |
improvement
|
| Mar 13, 2013 at 21:35 | comment | added | Leonid Shifrin | +1. Looks like this is what I tried to achieve with my code at the end of my post, but failed. | |
| Mar 13, 2013 at 21:31 | comment | added | Stefan | and now that you're in this is going to be even more interesting. | |
| Mar 13, 2013 at 21:20 | history | edited | Daniel Lichtblau | CC BY-SA 3.0 |
corrected code
|
| Mar 13, 2013 at 21:19 | history | undeleted | Daniel Lichtblau | ||
| Mar 13, 2013 at 20:17 | history | deleted | Daniel Lichtblau | ||
| Mar 13, 2013 at 20:14 | history | answered | Daniel Lichtblau | CC BY-SA 3.0 |