Timeline for How small can a language in NP\P be?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2012 at 4:50 | comment | added | Gerhard Paseman | Ladner's result on the existence of infinitely many languages of varying complexity in NP - P if there is at least one might also be relevant. Gerhard "Ask Me About System Design" Paseman, 2012.05.18 | |
| May 18, 2012 at 17:37 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |