Timeline for Is the square-root sum problem convex?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29 at 1:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 1 at 1:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 2 at 0:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jan 2 at 23:15 | answer | added | gnasher729 | timeline score: 0 | |
| Jan 1 at 18:44 | comment | added | AspiringMat | What do you mean by “solve approximately”? This is a decidability problem, how do you decide something approximately? Do you mean approximate the difference? In that case, you can binary search on the sqrt for each number ($2n$ in total) and calculate the difference to within any desired approximation (with the runtime of course depending on the approximation) | |
| Jan 1 at 17:06 | history | asked | Erel Segal-Halevi | CC BY-SA 4.0 |