Timeline for A language complete for NP intersection co-NP
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2010 at 6:56 | vote | accept | Opt | ||
| Aug 8, 2010 at 6:22 | answer | added | Ryan Williams | timeline score: 22 | |
| Aug 8, 2010 at 5:48 | answer | added | Marcos Villagra | timeline score: 0 | |
| Aug 8, 2010 at 5:29 | comment | added | user5810 | As far as I can find, there aren't any semantic classes that are known to have complete problems and are not known to be equal to a syntactic class. | |
| Aug 8, 2010 at 4:51 | history | asked | Opt | CC BY-SA 2.5 |