Deciding finiteness of matrix groups in las vegas polynomial time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 33-40

  Babai, László ^a,b  

^a UNIVERSITY OF CHICAGO   (United States)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

GROUP THEORY; MONTE CARLO METHODS; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ALGEBRAIC NUMBER FIELDS; BLACK-BOX GROUPS; COMPLEXITY CLASS; INFINITE GROUPS; INTEGRAL MATRICES; LAS VEGAS ALGORITHMS; RANDOMIZED ALGORITHMS; SYMBOLIC MANIPULATION;

MATRIX ALGEBRA;

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

References (26)

1. N. Alon: Eigenvalues and expanders, Combinatorics, 6 (1986), 83-96.
2. L. Babai: Trading group theory for randomness, in: Proc. 17th ACM STOC, Providence RI, 1985, pp. 421-429.
3. L. Babai: Bounded-round interactive proofs in finite groups, SIAM J. Discr. Math., to appear
4. L. Babai: Local expansion of vertex-transitive graphs and random generation in finite groups, in: Proc. 23rd ACM STOC, New Orleans LA, 1991, pp. 164-174.
5. L. Babai: Computational complexity in finite groups, Proc. International Congress of Mathematicians, Kyoto 1990, Springer, to appear
6. L. Babai, G. Cooperman, L. Finkelstein, A. Seress: Permutation groups with small base in almost linear time, in: ISSAC91 (Internat. Symp. on Symb. and Algebraic Comp.), Bonn 1991, pp. 200-209.
7. L. Babai, G. Cooperman, L. Finkelstein, E. M. Luks, A. Seress: Fast Monte Carlo algorithms for permutation groups, in: Proc. 23rd ACM STOC, New Orleans LA, 1991, pp. 90-100.
8. L. Babai, S. Kannan, E. M. Luks: Bounded-round interactive proofs for nonisomorphism of finite groups, in preparation
9. L. Babai, L. Ronyai: Computing irreducible representations of finite groups, Mathematics of Computation 55 (1990), pp. 705-722. (Preliminary version: 30th FOCS, 1989, pp. 9398.)
10. L. Babai, E. Szemerédi: On the complexity of matrix group problems I, in: Proc. 25th IEEE FOCS, Palm Beach FL, 1984, pp. 229240.
11. C.W. Curtis, I. Reiner: Representation Theory of Finite Groups and Associative Algebras, Wiley, 1966.
12. P. Diaconis: Group Representations in Probability and Statistics, Inst. Math. Stat. Hay-ward CA 1988.
13. J. Dixon: Computing irreducible representations of groups, Math. Comp. 24 (1970), 446450.
14. W. Eberly: Computations for group algebras and group representations, Ph. D. Thesis, Uni-versity of Toronto, 1989.
15. K. Friedl, L. Rönyai: Polynomial time solutions of some problems in computational algebra, in: Proc. 17th ACM STOC, 1985, pp. 153-162.
16. G. H. Golub, C. F. Van Loan: Matrix Computations, Johns Hopkins Univ. Press, Baltimore 1989.
17. P. Haimos: Finite-dimensional Vector Spaces, Van Nostrand, Princeton 1958.
18. W. M. Kantor, E. M. Luks: Computing in quotient groups, in: Proc. 22nd ACM STOC, Baltimore, 1990, pp. 524-534.
19. D. E. Knuth: Efficient representation of perm groups, Combinatorica 11 (1991), 57-68.
20. R. C. Lyndon, P. E. Schupp: Combinatorial Group Theory, Springer, New York 1977.
21. K. A. Mihailova: The occurrence problem for direct products of groups (in Russian), Dokl. Akad. Nauk SSSR 119 (1958), 1103-1105
22. and Mat. Sb. (N. S.) 70 (112) (1966), 241-251.
23. L. Rönyai: Simple algebras are difficult, in: Proc. 19th ACM STOC, 1987, pp. 398-408.
24. I. N. Sanov: A property of a representation of a free group, Doki Akad. Nauk SSSR 57 (1947), 657-659.
25. C. C. Sims, Some group theoretic algorithms, in: Lecture Notes in Math. 697 (1978), pp. 108-124.
26. A. Speiser: Die Theorie der Gruppen von endlicher Ordnung, Dritte Auflage, Dover, N.Y. 1937.