Skip to main content
2 events
when toggle format what by license comment
Jan 3 at 2:49 comment added Erel Segal-Halevi Suppose we have a black box that, given a convex program with all integer coefficients, decides whether it is feasible or not. Can we use it to solve Square-Root Sum? In other words, is there a reduction from Square-Root Sum to convex programming feasibility?
Jan 2 at 23:15 history answered gnasher729 CC BY-SA 4.0