Timeline for What is the computational-complexity-theoretic analogue of computable inseparability? For example, if P is not NP, are there disjoint NP sets with no separation in P?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 29, 2012 at 21:44 | answer | added | Benjamin Steinberg | timeline score: 7 | |
| Feb 29, 2012 at 14:19 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
revised question to NP intersect Co-NP
|
| Feb 29, 2012 at 13:58 | answer | added | user6976 | timeline score: 5 | |
| Feb 29, 2012 at 13:37 | history | asked | Joel David Hamkins | CC BY-SA 3.0 |