Information and Computation
Theoretical Computer Science
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
LWPP and WPP are not uniformly gap-definable
Journal of Computer and System Sciences
Complexity results in graph reconstruction
Discrete Applied Mathematics
Fast Algorithm for Graph Isomorphism Testing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
On the complexity of the hidden subgroup problem
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
SZK proofs for black-box group problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computational indistinguishability between quantum states and its cryptographic application
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Research paper: The saga of minimum spanning trees
Computer Science Review
| Hi-index | 0.00 |
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in \oplusP (in fact, it is in ModkP for each k \geqslant 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 permutationgroups known to be at least as hard as Graph Isomorphism (e.g. coset intersection) are in SPP, and thus in ModkP for each k \geqslant 2.