Timeline for What are the hardest problems that are in P if and only if P=NP?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2023 at 12:36 | comment | added | gnasher729 | (P = NP) is a constant boolean expression with currently unknown value. We don't know today if it is a trivial problem or an undecidable problem, but it is either one or the other. | |
| Jun 15, 2016 at 6:04 | vote | accept | Albert Hendriks | ||
| Jun 12, 2016 at 18:04 | comment | added | Raphael | @adrianN It's a constant. | |
| Jun 12, 2016 at 13:19 | comment | added | Tom van der Zanden | @adrianN It's the specification, not the implementation. You don't need to implement it. | |
| Jun 12, 2016 at 13:14 | comment | added | adrianN | How would you implement "if p=np" on a TM? | |
| Jun 12, 2016 at 8:02 | history | answered | D.W.♦ | CC BY-SA 3.0 |