Timeline for Sampling uniformly from the vertices of a polytope
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 13, 2019 at 15:37 | comment | added | Steve Huntsman | @LorenzoNajt- Thanks for the update! | |
| Nov 13, 2019 at 0:22 | comment | added | Elle Najt | It is $NP$-hard. See updated answer. | |
| Apr 20, 2019 at 5:17 | comment | added | Elle Najt | I think I was able to show it is NP-hard. Take a look and see if you believe my argument. :-) | |
| Apr 14, 2019 at 4:30 | comment | added | Elle Najt | I recently asked a question that turned out to be equivalent: cstheory.stackexchange.com/questions/42705/… I found some interesting references, but nothing definitive yet. | |
| Jan 3, 2019 at 0:50 | vote | accept | Steve Huntsman | ||
| Jan 2, 2019 at 14:54 | history | edited | Steve Huntsman |
edited tags
|
|
| Jan 2, 2019 at 14:44 | answer | added | Carlo Beenakker | timeline score: 5 | |
| Jan 2, 2019 at 14:10 | history | asked | Steve Huntsman | CC BY-SA 4.0 |