Timeline for What is the easiest randomized algorithm to motivate to the layperson?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:18 | review | Late answers | |||
| Sep 30, 2015 at 7:38 | |||||
| Mar 4, 2011 at 12:01 | comment | added | Emil Jeřábek | Primality testing was actually mentioned in several comments above. The standard Rabin–Miller algorithm is easier to explain, easier to analyze, and easier to implement than Solovay–Strassen, and it has both a lower probability of error and (somewhat) better running time. In other words, after Rabin the Solovay–Strassen algorithm is but a useless historical curiosity. | |
| Mar 4, 2011 at 11:14 | history | answered | none | CC BY-SA 2.5 |