Sciweavers

FOCS
2002
IEEE

Graph Isomorphism is in SPP

13 years 8 months ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FPSPP algorithm. This general result has other consequences: for example, it follows that the hidden subgroup problem for permutation groups, studied in the context of quantum algorithms, has an FPSPP algorithm. Also, some other algorithmic problems over permutation groups known to be at least as hard as Graph Isomorphism (e.g. coset intersection) are in SPP, and thus in ModkP for each k ≥ 2.
Vikraman Arvind, Piyush P. Kurur
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where FOCS
Authors Vikraman Arvind, Piyush P. Kurur
Comments (0)