Timeline for Polynomials that are sums of squares
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2015 at 0:40 | comment | added | Markus Schweighofer | I guess it is not clear whether it is really doable in polynomial time. The complexity status of the semidefinite feasibility theorem is unknown. Although some people believe it could be in P it is not even known to be in NP. | |
| Feb 11, 2014 at 13:56 | history | answered | Bill Bradley | CC BY-SA 3.0 |