Timeline for poly-time algorithm to choose elements of sets
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2010 at 13:08 | vote | accept | simone | ||
| Jun 10, 2010 at 20:29 | comment | added | Joel David Hamkins | I added the complexity-theory and NP tags. | |
| Jun 10, 2010 at 20:29 | history | edited | Joel David Hamkins |
Added complexity-theory and NP tags
|
|
| Jun 10, 2010 at 18:22 | answer | added | darij grinberg | timeline score: 3 | |
| Jun 10, 2010 at 18:15 | comment | added | darij grinberg | This rather sounds like reducing 3SAT to me. | |
| Jun 10, 2010 at 18:09 | comment | added | Gerhard Paseman | This sounds related to 3 dimensional matching, an NP hard problem. Perhaps someone can post a reduction of 3DM or nDM to this problem? Gerhard "Ask Me About System Design" Paseman, 2010.06.10 | |
| Jun 10, 2010 at 17:57 | history | asked | simone | CC BY-SA 2.5 |