Timeline for Is it appropriate to post question asking to prove NP-completness of more than one problem?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Jan 7, 2015 at 18:43 | comment | added | Mohammad Al-Turkistany | @GeraldEdgar Both sites have experts on computational complexity. Usually, I first post on TCS SE and offer a bounty. Then I post on mathOverflow if I did not get a satisfying answer. Sometimes, such as the first example above, a post generates more interest among mathOverflow members. | |
| Jan 7, 2015 at 17:19 | comment | added | Gerald Edgar | Even if a question is on-topic in more than one site, choose just one site and ask it there. Which site do you think is more likely to have experts that can contribute toward an answer? | |
| Jan 6, 2015 at 15:06 | comment | added | Joel David Hamkins | NP completeness is also on-topic here at MO. | |
| Jan 6, 2015 at 10:54 | comment | added | user9072 | Upvoted since this is a reasonable question to ask; I have no specific opinion on the subject itself. | |
| Jan 6, 2015 at 10:52 | history | edited | user9072 |
edited tags
|
|
| Jan 6, 2015 at 7:52 | comment | added | Nate Eldredge | I think you should consider posting questions about NP-completeness on cstheory.stackexchange.com instead. | |
| Jan 6, 2015 at 1:18 | history | edited | Mohammad Al-Turkistany | CC BY-SA 3.0 |
added 25 characters in body
|
| Jan 6, 2015 at 1:13 | history | asked | Mohammad Al-Turkistany | CC BY-SA 3.0 |