Timeline for Is quadratic programming still NP-hard if you have bounds and a feasible point?
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2010 at 5:37 | vote | accept | Mikola | ||
| Jul 23, 2010 at 5:29 | history | answered | Matus Telgarsky | CC BY-SA 2.5 |