Timeline for Is the "Fewest Discriminating Bits" problem NP-complete?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 16, 2011 at 0:32 | answer | added | Tsuyoshi Ito | timeline score: 14 | |
| Jan 14, 2011 at 10:55 | history | tweeted | twitter.com/#!/StackCSTheory/status/25868612669546496 | ||
| Jan 14, 2011 at 6:06 | comment | added | Aryabhata | Related: Bondy's theorem. | |
| Jan 14, 2011 at 5:40 | vote | accept | andy_fingerhut | ||
| Jan 14, 2011 at 5:11 | history | edited | Kaveh | CC BY-SA 2.5 |
edited title; edited tags
|
| Jan 14, 2011 at 4:18 | answer | added | mjqxxxx | timeline score: 18 | |
| Jan 14, 2011 at 1:55 | history | asked | andy_fingerhut | CC BY-SA 2.5 |