Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > GAP-DEFINABLE COMPLEXITY CLASSES:
Reports tagged with gap-definable complexity classes:
TR02-037 | 21st May 2002
Vikraman Arvind, Piyush Kurur

Graph Isomorphism is in SPP

We show that Graph Isomorphism is in the complexity class
SPP, and hence it is in $\ParityP$ (in fact, it is in $\ModkP$ for
each $k\geq 2$). We derive this result as a corollary of a more
general result: we show that a {\em generic problem} $\FINDGROUP$ has
an $\FP^{\SPP}$ ... more >>>

ISSN 1433-8092 | Imprint