Timeline for Average case algorithm analysis using Kolmogorov Incompressibility Method
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:37 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Aug 19, 2015 at 15:41 | answer | added | Nikos M. | timeline score: 1 | |
| Dec 23, 2014 at 15:52 | vote | accept | user3813812 | ||
| Dec 23, 2014 at 12:21 | answer | added | Yuval Filmus | timeline score: 4 | |
| Dec 23, 2014 at 11:46 | comment | added | Juho | It might make some cases easier to analyze, but I wouldn't say it's still easy. One of the nicest examples is proving there are infinitely many primes. Applying the method to a certain interesting algorithm successfully tends to be worth a research paper from my experience. | |
| Dec 23, 2014 at 11:37 | history | tweeted | twitter.com/#!/StackCompSci/status/547355215469756416 | ||
| Dec 23, 2014 at 9:39 | review | First posts | |||
| Dec 23, 2014 at 10:12 | |||||
| Dec 23, 2014 at 9:29 | history | asked | user3813812 | CC BY-SA 3.0 |