Timeline for Algorithm for the intersection of a vector subspace with a cone of non-negative vectors
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2020 at 3:13 | comment | added | Marcelo Pedro | Is there any reference for the algorithm described in the question? | |
| Mar 26, 2015 at 22:02 | answer | added | Raymond Hemmecke | timeline score: 1 | |
| Nov 12, 2011 at 22:20 | history | edited | Miroslav Korbelar |
edited tags
|
|
| Nov 12, 2011 at 20:38 | answer | added | Dustin Cartwright | timeline score: 4 | |
| Nov 11, 2011 at 8:27 | answer | added | mikitov | timeline score: 2 | |
| Nov 11, 2011 at 8:07 | history | edited | Miroslav Korbelar | CC BY-SA 3.0 |
edited body
|
| Nov 10, 2011 at 20:08 | comment | added | Miroslav Korbelar | The algorithm above requires to test (generally) $2^n$ cases of $W_{F}$ (or at least till one doesn't meet the 1-dimensional ones). This seems to be quite much to me. That is why I have asked whether there is known some better implementation or a completely different approach. | |
| Nov 10, 2011 at 19:00 | comment | added | Igor Rivin | How much more efficient would like it to be? | |
| Nov 10, 2011 at 17:39 | history | edited | Miroslav Korbelar | CC BY-SA 3.0 |
edited title; edited title
|
| Nov 10, 2011 at 17:04 | history | asked | Miroslav Korbelar | CC BY-SA 3.0 |