Graph isomorphism is in SPP

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 743-750

  Arvind, V ^a   Kurur, Piyush P ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; SET THEORY;

GRAPH ISOMORPHISM; PERMUTATION GROUPS; QUANTUM ALGORITHM;

COMPUTER SCIENCE;

EID: 0036957618     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. V. Arvind and N. V. Vinodchandran. Solvable black-box group problems are low for PP. Theoretical Computer Science, 180(1-2):17-45, 1997.
2. L. Babai. Bounded round interactive proofs in finite groups. SIAM journal of Discrete Mathematics, 5(1):88-111, February 1992.
3. L. Babai and E. M. Luks. Canonical labeling of graphs. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 171-183, 1983.
4. L. Babai and S. Moran. Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36:254-276, 1988.
5. L. Babai and E. Szemeredi. On the complexity of matrix group problems I. In Proceedings of the 24th IEEE Foundations of Computer Science, pages 229-240, 1984.
6. R. Boppana, J. Hastad, and S. Zachos. Does co-NP have short interactive proofs. Information Processing Letters, 25:127-132, May 1987.
7. Stephen A. Fenner, Lance Fortnow, and Stuart A. Kurtz. Gap-definable counting classes. In Structure in Complexity Theory Conference, pages 30-42, 1991.
8. Lance Fortnow and John D. Rogers. Complexity limitations on quantum computation. In IEEE Conference on Computational Complexity, pages 202-209, 1998.
9. Merrick L. Furst, John E. Hopcroft, and Eugene M. Luks. Polynomial-time algorithms for permutation groups. In IEEE Symposium on Foundations of Computer Science, pages 36-41, 1980.
10. S Hallgren, A Russel, and A Ta-Shma. Normal subgroup reconstruction and quantum computing using group representation. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 627-635, Portland, Oregon, 21-23 May 2000.
11. C. M. Hoffmann. Group-Theoretic Algorithms and Graph Isomorphism. Springer, Berlin, Heidelberg, 1982.
12. G. Ivanyos, F. Magniez, and M. Santha. Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In 13th ACM Symposium on Parallel Algorithms and Architectures, pages 263-270, 2001.
13. Johannes Köbler, Uwe Schöning, and Jacobo Torán. Graph isomorphism is low for PP. Computational Complexity, 2(4):301-330, 1992.
14. Johannes Köbler, Uwe Schöning, and Jacobo Torán. The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser, 1993.
15. Eugene M. Luks. Permutation groups and polynomial time computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 11:139-175, 1993.
16. R Mathon. A note on graph isomorphism counting problem. Information Processing Letters, 8(3):131-132, 15 March 1979.
17. M Mosca. Quantum Computer algorithms. PhD thesis, Oxford University, 1999.
18. Uwe Schöning. Graph isomorphism is in the low hierarchy. In Symposium on Theoretical Aspects of Computer Science, pages 114-124, 1987.
19. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
20. C C Sims. Computational methods in the study of permutation groups. Computational problems in Abstract Algebra, pages 169-183, 1970.
21. N. V. Vinodchandran. Improved lowness results for solvable black-box group problems. Lecture Notes in Computer Science, 1346:220-??, 1997.
22. Helmut Weilandt. Finite Permutation Groups. Academic Press, New York, 1964.