Timeline for Problems Between P and NPC
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2013 at 17:58 | comment | added | Joshua Grochow | I think it's worth mentioning the classes $\mathsf{LOGNP}$ and $\mathsf{NP}[\log^2 n]$ defined in the paper linked in the answer as well as the other natural problems in that paper that are shown to be in these classes, since any problem complete for these classes is likely to be of intermediate complexity. | |
| S Nov 21, 2013 at 10:37 | history | answered | Mohammad Al-Turkistany | CC BY-SA 3.0 | |
| S Nov 21, 2013 at 10:37 | history | made wiki | Post Made Community Wiki by Mohammad Al-Turkistany |