Timeline for Showing that a problem in X is not X-Complete
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2012 at 15:55 | history | edited | Raphael |
edited tags
|
|
| Apr 20, 2012 at 6:26 | answer | added | Kaveh | timeline score: 3 | |
| Apr 19, 2012 at 7:51 | vote | accept | Dave Clarke | ||
| Apr 17, 2012 at 21:54 | answer | added | Ryan Williams | timeline score: 16 | |
| Apr 17, 2012 at 21:01 | answer | added | Mohammad Al-Turkistany | timeline score: 3 | |
| Apr 4, 2012 at 11:14 | history | edited | Dave Clarke | CC BY-SA 3.0 |
added 129 characters in body
|
| Apr 3, 2012 at 21:28 | answer | added | Joe | timeline score: 11 | |
| Apr 3, 2012 at 1:10 | comment | added | user742 | Sure It's not easy and no one can provide an answer for your general part :-) I have too many problems I know they are NP but I don't know they are NP-Complete or not (neither too many other people). | |
| Apr 3, 2012 at 0:54 | history | tweeted | twitter.com/#!/StackCompSci/status/186979902279520257 | ||
| Apr 3, 2012 at 0:28 | history | asked | Dave Clarke | CC BY-SA 3.0 |