Timeline for What would be an appropriate algorithm to factorise numbers in the range of a few billion?
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 14, 2012 at 14:47 | answer | added | Miguel Rentes | timeline score: 0 | |
| Dec 23, 2011 at 0:27 | answer | added | user8709 | timeline score: 0 | |
| Dec 22, 2011 at 22:45 | comment | added | DeadMG | This is a mathematically difficult problem, and you will not find an ideal solution. | |
| Dec 22, 2011 at 14:08 | history | edited | Chris | CC BY-SA 3.0 | added 335 characters in body |
| Dec 22, 2011 at 14:06 | vote | accept | Chris | ||
| Dec 22, 2011 at 12:14 | answer | added | Daniel Scocco | timeline score: 5 | |
| Dec 22, 2011 at 11:54 | answer | added | sleske | timeline score: 4 | |
| Dec 22, 2011 at 11:28 | comment | added | sebastiangeiger | Maybe you are right in general, but for project euler it is usually more important to find a "smart" algorithm. They are a lot faster than parallelizing brute force approaches. | |
| Dec 22, 2011 at 11:25 | history | tweeted | twitter.com/#!/StackProgrammer/status/149812830412083200 | ||
| Dec 22, 2011 at 11:17 | answer | added | pdr | timeline score: 1 | |
| Dec 22, 2011 at 11:03 | comment | added | NoChance | Such problems may best use parallel processing. | |
| Dec 22, 2011 at 11:01 | answer | added | Jack V. | timeline score: 4 | |
| Dec 22, 2011 at 10:55 | answer | added | sebastiangeiger | timeline score: 2 | |
| Dec 22, 2011 at 10:33 | history | asked | Chris | CC BY-SA 3.0 |