Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR03-063 | 2nd July 2003 00:00

The Size of SPP

RSS-Feed




TR03-063
Authors: John Hitchcock
Publication: 8th September 2003 19:54
Downloads: 1310
Keywords: 


Abstract:

Derandomization 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.



ISSN 1433-8092 | Imprint