The complexity of promise problems with applications to public-key cryptography
Information and Control
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
Turing machines with few accepting computations and low sets for PP
Journal of Computer and System Sciences
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Computing functions with parallel queries to NP
Theoretical Computer Science
Solvable black-box group problems are low for PP
Theoretical Computer Science
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Normal subgroup reconstruction and quantum computation using group representations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Graph Isomorphism is in the Low Hierarchy
STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Limitations on Quantum Computation
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Counting Complexity of Solvable Black-Box Group Problems
SIAM Journal on Computing
Polynomial-time algorithms for permutation groups
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
The complexity of symmetric Boolean parity Holant problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
The isomorphism problem for k-trees is complete for logspace
Information and Computation
| Hi-index | 0.00 |
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in @?P (in fact, in Mod"kP for each k=2). These inclusions for Graph Isomorphism were not known prior to membership in SPP. We derive this result as a corollary of a more general result: we show that a generic problem FIND-GROUP has an FP^S^P^P 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 FP^S^P^P 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 Mod"kP for each k=2.