ECCC-Report TR03-063https://eccc.weizmann.ac.il/report/2003/063Comments and Revisions published for TR03-063en-usMon, 08 Sep 2003 19:54:40 +0300
Paper TR03-063
| The Size of SPP |
John Hitchcock
https://eccc.weizmann.ac.il/report/2003/063Derandomization techniques are used to show that at least one of the
following holds regarding the size of the counting complexity class
SPP.
1. SPP has p-measure 0.
2. PH is contained in SPP.
In other words, SPP is small by being a negligible subset of
exponential time or large by containing the entire polynomial-time
hierarchy. This addresses an open problem about the complexity of the
graph isomorphism problem: it is not weakly complete for exponential
time unless PH is contained in SPP. It is also shown that the
polynomial-time hierarchy is contained in SPP^NP if NP does not
have p-measure 0.
Mon, 08 Sep 2003 19:54:40 +0300https://eccc.weizmann.ac.il/report/2003/063