Timeline for Simple and practical deterministic algorithm, complicated running time
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2010 at 18:35 | comment | added | Niel de Beaudrap | you could then say that a brute-force search for a proof of the Collatz conjecture also motivates "novel run-time analysis techniques"; in both cases the algorithm is just mindlessly exploring a digraph. The Collatz conjecture is fun, but I don't think this is an interesting example of "an algorithm". | |
| Nov 16, 2010 at 22:50 | comment | added | Mohammad Al-Turkistany | It suggests looking for novel run-time analysis techniques. | |
| Nov 16, 2010 at 22:38 | comment | added | Jukka Suomela | And what is the problem solved by this algorithm...? | |
| Nov 16, 2010 at 22:34 | history | edited | Mohammad Al-Turkistany | CC BY-SA 2.5 |
added details
|
| Nov 16, 2010 at 22:10 | history | answered | Mohammad Al-Turkistany | CC BY-SA 2.5 |