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 | |
|---|---|---|---|---|---|
| Mar 1, 2012 at 14:21 | history | edited | Emil Jeřábek | CC BY-SA 3.0 |
it is not what is usually meant by a OWF
|
| Mar 1, 2012 at 11:27 | comment | added | François G. Dorais | Complexity Zoo entry for UP: qwiki.stanford.edu/index.php/Complexity_Zoo:U#up | |
| Mar 1, 2012 at 11:23 | history | edited | François G. Dorais | CC BY-SA 3.0 |
fixed typo
|
| Feb 29, 2012 at 21:44 | history | answered | Benjamin Steinberg | CC BY-SA 3.0 |