Abstract
In this paper we show that several algorithmic problems for abelian black-box groups and solvable black-box groups are low for PP. In particular, we prove that Membership Testing, Group Intersection, Order Verification, and Group Isomorphism for abelian groups are in SPP, and Group Factorization, Coset Intersection, and Double Coset Membership for abelian groups are in LWPP. Similarly, we show that Membership Testing, Order Verification, and Group Isomorphism for solvable groups are in ZPPSPP. We also show that Group Intersection, Group Factorization, Coset Intersection, and Double Coset Membership for solvable groups are low for PP.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Babai. Bounded round interactive proofs in finite groups. SIAM Journal of Discrete Mathematics, 5: 88–111, 1992.
L. Babai. Trading group theory for randomness. 17th ACM Symp. Theory of Computing, 421–429, 1985.
L. Babai, G. Cooperman, L. Finkelstein, E. Luks and Á. Seress. Fast Monte Carlo algorithms for permutation groups. In Journal of Computer and System Sciences,50: 296–308, 1995.
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.
L. Babai, E. Luks and Á. Seress. Fast management of permutation groups. Proc. 28th IEEE Symposium on Foundations of Computer Science, 272–282, 1988.
L. Babai and M. Szemerédi. On the complexity of matrix group problems I. Proc. 25th IEEE Symposium on Foundations of Computer Science, 229–240, 1984.
R. Beals and L. Babai. Las Vegas algorithms for matrix groups. Proc. 25th ACM Symposium on Theory of Computing, pp. 427–436, 1993.
R. Boppana, J. Hastad and S. Zachos. Does coNP have short interactive proofs? Information Processing Letters, 25: 127–132, 1987.
W. Burnside. Theory of Groups of Finite Order, Dover Publications, INC, 1955.
G. Cooperman and L. Finkelstein. Combinatorial tools for computational group theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 11, 1993.
S. Fenner, L. Fortnow, S. Kurtz. Gap-definable counting classes. Proc. 6th Structure in Complexity Theory Conference, 30–42, 1991.
M. Fellows and N. Koblitz. Self-witnessing polynomial time complexity and prime factorization. Proc. 6th Structure in Complexity Theory Conference, 107–110, 1992.
M. Furst, J. E. Hopcroft and E. Luks. Polynomial time algorithms for permutation groups. Proc. 21st IEEE Symposium of Foundations of Computer Science, 36–45, 1980.
M. Hall. The Theory of Groups. Macmillan, New York, 1959.
C. Hoffmann. Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science #136, Springer Verlag, 1982.
J. Köbler, U. Schöning, J. Torán. Graph isomorphism is low for PP. Journal of Computational Complexity, 2: 301–310, 1992.
E. M. Luks. Computing in solvable matrix groups. Proc. 33rd IEEE Symposium on Foundations of Computer Science, 111–120, 1992.
U. Schöning. Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences, 37: 312–323, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arvind, V., Vinodchandran, N.V. (1996). Solvable black-box group problems are low for PP. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_9
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive