Timeline for How can one characterize NP^SAT?
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2016 at 14:24 | comment | added | mak | NP^NP actually is in the complexity zoo under its alternative name Sigma_2^p: complexityzoo.uwaterloo.ca/Complexity_Zoo:S#sigma2p There are some complete problems given there. | |
| Oct 23, 2009 at 15:24 | comment | added | sdcvvc | See also: en.wikipedia.org/wiki/Polynomial_hierarchy | |
| Oct 23, 2009 at 8:35 | history | answered | subshift | CC BY-SA 2.5 |