Timeline for If P=NP, does this imply that all problems are NP-hard?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 5, 2020 at 1:31 | vote | accept | Andrew Rashenda | ||
| Aug 24, 2020 at 16:42 | answer | added | A.M. | timeline score: 1 | |
| Aug 24, 2020 at 3:52 | comment | added | Bernardo Subercaseaux | You probably want to include non-trivial as an hypothesis, as the empty language or $\Sigma^*$ are not NP-hard regardless of whether P=NP or not. | |
| Aug 24, 2020 at 3:24 | history | asked | Andrew Rashenda | CC BY-SA 4.0 |