Timeline for Lagrange four-squares theorem --- deterministic complexity
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2019 at 9:45 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
replaced link to a footnote by a direct link to the Wikipedia article - which was probably the intended link
|
| Apr 20, 2019 at 9:36 | history | edited | Martin Sleziak |
added the (sums-of-squares) tag
|
|
| Apr 19, 2019 at 14:52 | vote | accept | ckamath | ||
| Apr 19, 2019 at 14:49 | history | became hot network question | |||
| Apr 19, 2019 at 14:38 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 19, 2019 at 14:36 | answer | added | Tony Huynh | timeline score: 19 | |
| Apr 19, 2019 at 13:51 | comment | added | Wojowu | Your parenthetical remark is essentially correct. For instance, this is at least as difficult as factoring semiprimes, because it lets us compute $1+p+q+pq$ given a semiprime $pq$, and from $p+q,pq$ it's easy to compute $p,q$. | |
| Apr 19, 2019 at 13:25 | review | First posts | |||
| Apr 19, 2019 at 13:25 | |||||
| Apr 19, 2019 at 13:22 | history | asked | ckamath | CC BY-SA 4.0 |