Timeline for Is P contained in NP-hard?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 11, 2021 at 14:56 | comment | added | HelloGoodbye | That a problem X can be reduced to an NP-hard problem does not mean that X itself is NP-hard. Also, the phrase "all problems that can be reduced in polynomial time from a problem in NP to them" does not really make sense to me, so think through what you mean by this and rephrase it in a way that makes sense; maybe doing so will simultaneously clear up your confusion. | |
| Apr 29, 2020 at 14:59 | vote | accept | Heitor | ||
| S Apr 25, 2020 at 2:09 | history | suggested | ShyPerson | CC BY-SA 4.0 |
Light editing; could use more
|
| Apr 25, 2020 at 0:14 | review | Suggested edits | |||
| S Apr 25, 2020 at 2:09 | |||||
| Apr 24, 2020 at 20:36 | comment | added | Yuval Filmus | Check our reference question. | |
| Apr 24, 2020 at 18:03 | answer | added | Steven | timeline score: 1 | |
| Apr 24, 2020 at 17:36 | answer | added | Noah Schweber | timeline score: 2 | |
| Apr 24, 2020 at 17:27 | review | First posts | |||
| Apr 25, 2020 at 0:14 | |||||
| Apr 24, 2020 at 17:26 | history | asked | Heitor | CC BY-SA 4.0 |