Timeline for Fast quadratic norm algorithms
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2014 at 23:50 | comment | added | NAME_IN_CAPS | Now that I think about, the fact that you have a diagonal conic means that you would only have to factor $a$ and $b$, and 8 digits is small enough to have a look-up table. Cremona-Rusin might also be faster for conics like these, Simon is more for large coefficients with small discriminant. | |
| Jun 24, 2014 at 6:13 | vote | accept | Neil Strickland | ||
| S Jun 23, 2014 at 4:22 | history | suggested | Zack Wolske | CC BY-SA 3.0 |
corrected link
|
| Jun 23, 2014 at 4:04 | review | Suggested edits | |||
| S Jun 23, 2014 at 4:22 | |||||
| Jun 22, 2014 at 22:06 | history | edited | NAME_IN_CAPS | CC BY-SA 3.0 |
added 535 characters in body
|
| Jun 22, 2014 at 21:46 | history | answered | NAME_IN_CAPS | CC BY-SA 3.0 |