Timeline for If P = NP, then how not cannot solve NP-hardness (the one that doesn't intersect with NP-complete) in polynomial-time?
Current License: CC BY-SA 3.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2017 at 11:30 | history | answered | user12859 | CC BY-SA 3.0 |