Solvable black-box group problems are low for PP

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 17-45

  Arvind, V ^a   Vinodchandran, N V ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ABELIAN BLACK BOX GROUPS; CANONICAL GENERATOR SET; ORACLE ALGORITHM; SOLVABLE BLACK BOX GROUPS;

COMPUTATION THEORY;

EID: 0031168128     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00100-4     Document Type: Article

References (18)

1. L. Babai, Bounded round interactive proofs in finite groups, SIAM J. Discrete Math. 5 (1992) 88-111.
2. L. Babai, Trading group theory for randomness, 17th ACM Symp. Theory of Computing (1985) 421-429.
3. L. Babai, G. Cooperman, L. Finkelstein, E. Luks and Á. Seress, Fast Monte Carlo algorithms for permutation groups, J. Comput. System Sci. 50 (1995) 296-308.
4. L. Babai and S. Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci. 36 (1988) 254-276.
5. L. Babai, E. Luks and Á. Seress, Fast management of permutation groups, Proc. 28th IEEE Symp. on Foundations of Computer Science (1988) 272-282.
6. L. Babai and M. Szemerédi, On the complexity of matrix group problems I, Proc. 25th IEEE Symp. on Foundations of Computer Science (1984) 229-240.
7. R. Beals and L. Babai, Las Vegas algorithms for matrix groups, Proc. 25th ACM Symp. on Theory of Computing (1993) 427-436.
8. R. Boppana, J. Hastad and S. Zachos, Does coNP have short interactive proofs?, Inform. Process. Lett. 25 (1987) 127-132.
9. W. Burnside, Theory of Groups of Finite Order (Dover Publications, INC, New York, 1955).
10. G. Cooperman and L. Finkelstein, Combinatorial tools for computational group theory, DIMACS Series in Discrete Math. and Theoretical Comput. Sci. Vol. 11 (1993).
11. S. Fenner, L. Fortnow and S. Kurtz, Gap-definable counting classes, Proc. 6th Structure in Complexity Theory Conf. (1991) 30-42.
12. M. Fellows and N. Koblitz, Self-witnessing polynomial time complexity and prime factorization, Proc. 6th Structure in Complexity Theory Conf. (1992) 107-110.
13. M. Furst, J.E. Hopcroft and E. Luks, Polynomial time algorithms for permutation groups, Proc. 21st IEEE Symp. of Foundations of Computer Science (1980) 36-45.
14. M. Hall, The Theory of Groups (Macmillan, New York, 1959).
15. C. Hoffmann, Group-Theoretic Algorithms and Graph Isomorphism, Lecture Notes in Computer Science, Vol. 136 (Springer, Berlin, 1982).
16. J. Köbler, U. Schöning and J. Torán, Graph isomorphism is low for PP, J. Comput. Complexity 2 (1992) 301-310.
17. E.M. Luks, Computing in solvable matrix groups, Proc. 33rd IEEE Symp. on Foundations of Computer Science (1992) 111-120.
18. U. Schöning, Graph isomorphism is in the low hierarchy, J. Comput. System Sci. 37 (1988) 312-323.