Timeline for Are there any fast algorithms for factoring integers that don't work by searching for smooth numbers?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2013 at 6:22 | answer | added | Gerry Myerson | timeline score: 2 | |
| Dec 2, 2013 at 13:33 | comment | added | Craig Feinstein | @GregMartin, I agree. | |
| Dec 2, 2013 at 7:53 | comment | added | Greg Martin | I find the terminology "friable" far superior to "smooth" for this arithmetic property. | |
| Dec 1, 2013 at 21:03 | vote | accept | Craig Feinstein | ||
| Dec 1, 2013 at 19:58 | history | edited | Ricardo Andrade |
replaced new, inappropriate tag pieces 'number' and 'theory'
|
|
| Dec 1, 2013 at 18:33 | answer | added | Turbo | timeline score: 4 | |
| Dec 1, 2013 at 18:24 | answer | added | Watson Ladd | timeline score: 3 | |
| Dec 1, 2013 at 18:10 | answer | added | guest | timeline score: 7 | |
| Dec 1, 2013 at 18:01 | history | asked | Craig Feinstein | CC BY-SA 3.0 |