Timeline for $2k$ number assignment
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 2, 2013 at 15:24 | comment | added | gprime | Could it be maybe a bipartite matching? I will look into the 3-matching to see if i can figure it out. Thanks! | |
| Jun 1, 2013 at 11:34 | comment | added | Peter Shor | Actually, to me it looks like a special case of 3-matching, which is NP-complete. This doesn't mean that the OPs problem is NP-complete. | |
| May 31, 2013 at 18:58 | comment | added | gprime | Can you elaborate? I am failing to see how i can use that algorithms to solve my question. | |
| May 30, 2013 at 4:00 | comment | added | Luke Mathieson | The Stackexchange idea is to have a Q&A that's as complete as reasonably possible. Would you be able to expand you answer to be more than just a link to wikipedia? | |
| May 30, 2013 at 1:23 | review | First posts | |||
| May 30, 2013 at 4:00 | |||||
| May 30, 2013 at 1:04 | history | answered | Will | CC BY-SA 3.0 |