Timeline for Deciding membership in a convex hull
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 9, 2020 at 13:12 | history | edited | Rodrigo de Azevedo | CC BY-SA 4.0 |
edited tags
|
| Oct 15, 2014 at 23:37 | answer | added | Joseph O'Rourke | timeline score: 4 | |
| Oct 15, 2014 at 22:46 | history | edited | user9072 |
edited tags
|
|
| Jan 16, 2010 at 22:03 | vote | accept | Mitch | ||
| Jan 12, 2010 at 8:38 | comment | added | Suresh Venkat | Btw it's not true that you can solve this in time poly in n and m. such an algorithm would be as trongly polynomial time algorithm for linear programming, which is as yet unknown. what is true is that you can solve it in polynomial time, but the running time involves terms relating to the bit complexity of the problem: en.wikipedia.org/wiki/Linear_programming#Algorithms | |
| Jan 12, 2010 at 6:54 | answer | added | Greg Kuperberg | timeline score: 15 | |
| Jan 12, 2010 at 5:49 | answer | added | Steve Huntsman | timeline score: 8 | |
| Jan 12, 2010 at 5:18 | history | asked | Mitch | CC BY-SA 2.5 |