Multiplicative equations over commuting matrices

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 498-507

  Babai, László ^a,b   Beals, Robert ^c,d   Cai, Jin Yi ^e   Ivanyos, Gábor ^f   Luks, Eugene M ^g  

^a THE UNIVERSITY OF CHICAGO   (United States)

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

^c RUTGERS UNIVERSITY   (United States)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

^e UNIVERSITY AT BUFFALO   (United States)

^f INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^g UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GERMANIUM; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ALGEBRAIC NUMBER FIELDS; ALL SOLUTIONS; COMMUTING MATRIX; GROUP MEMBERSHIP PROBLEM; MEMBERSHIP PROBLEM; NEGATIVE VALUES; NONNEGATIVE INTEGERS; POLYNOMIAL-TIME ALGORITHMS;

MATRIX ALGEBRA;

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

References (40)

1. E. Bach, J. Driscoll, J. O. Shallit: Factor refinement, Proc 1st ACM-SIAM SODA (1990), 201-211. J. Algorithms, to appear.
2. A. Baker, G. Wüstholz: Logarithmic forms and group varieties, J. reine angew. Math. 442 (1993), 19-62.
3. R. Beals, L. Babai: Las Vegas algorithms for matrix groups, Proc. 34th IEEE FOCS (1993), 427-436.
4. L. Babai, R. Beals, D. Rockmore: Deciding finiteness of matrix groups in deterministic polynomial time, Israel J. Math., to appear.
5. R. Beals: Algorithms for matrix groups and the Tits alternative, Proc. 36th IEEE FOCS (1995), pp. 593-602.
6. M. Beaudry: Membership testing in commutative transformation semigroups, Information and Computation 79 (1988), 84-93.
7. J. Cai: Computing Jordan Normal Forms exactly for commuting matrices in polynomial time, SUNY Buffalo CS Tech Report 94-16.
8. J-y. Cai, R. J. Lipton, Y. Zalcstein: The complexity of the membership problem for 2-generated commutative semigroups of rational matrices, Proc 35th IEEE FOCS (1994), 135-142.
9. H. Cohen: A course in computational algebraic number theory, Graduate Texts in Math. 138, Springer-Verlag, Berlin, 1993.
10. G. E. Collins: Subresultants and reduced polynomial remainder sequences, J. ACM (1967), 128-142.
11. W. M. Eberly: Decomposition of algebras over finite fields and number fields, Computational Complexity 1 (1991), 179-206.
12. K. Friedl, L. Rónyai: Polynomial time solutions of some problems in abstract algebra, Proc 17th ACM STOC (1985), 153-162.
13. F. R. Gantmacher: Matrix Theory, Chelsea Publishing, New York, 1959.
14. G. Ge: Algorithms related to multiplicative representations of algebraic numbers, PhD thesis, Math Dept, U. C. Berkeley, 1993.
15. G. Ge: Testing equalities of multiplicative representations in polynomial time, Proc 34th IEEE FOCS (1993), 422-426.
16. G. Ge: Recognizing units in number fields, Math. Comp. 63, No. 207, 377-387.
17. P. Gianni, V. Miller, B. Trager: Decomposition of algebras, Lecture Notes in Computer Science 358, Springer-Verlag 1988, 300-308.
18. D.Yu. Grigoryev, A.L. Chistov: Polynomial-time factoring of the multivariable polynomials over a global field. Preprint, LOMI E-5-82, 1982, 39 pp.
19. D.Yu. Grigoryev, A.L. Chistov: Fast decomposition of polynomials into irreducible ones and the solution of systems of algebraic equations, Soviet Math. Dokl. 29 (1984), 380-383.
20. J. Håstad, B. Helfrich, J. Lagarias, C. P. Schnorr: Polynomial time algorithms for finding integer relations among real numbers, Proc 3rd STACS (1986), 105-118.
21. m), Applicable Algebra in Engineering, Communication and Computing 5 (1994), 71-90.
22. R. Kannan: The size of numbers in the analysis of certain algorithms, Ph.D. Thesis, Operations Research Dept., Cornell University, Ithaca, NY 1980.
23. R. Kannan, R. Lipton: Polynomial-time algorithms for the orbit problem, J. ACM 33, No. 4 (1986), 808-821.
24. V. M. Kopytov: Solvability of the problem of occurrence in finitely generated soluble groups over the field of algebraic numbers, Algebra and Logic 7 (1968), 388-393, translated from Algebra i Logika 7 (1968), 53-63.
25. S. Landau: Factoring polynomials over algebraic number fields, SIAM J. Comput. 14 (1985), 184-195
26. Erratum in SLAM J. Comput. 20 (1991).
27. A. K. Lenstra: Factoring polynomials over algebraic number fields, Proc. EUROCAL'83, Springer L.N.C.S. Vol. 162, 1983, pp. 245-254.
28. H. W. Lenstra: Integer programming with a fixed number of variables, Mathematics of Operations Research 8 (1983), 538-548.
29. A. K. Lenstra, H. W. Lenstra, L. Lovasz: Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515-534.
30. E. M. Luks: Computing in solvable matrix groups, Proc. 33rd IEEE FOCS (1992), 111-120.
31. D. W. Masser: Linear relations on algebraic groups, in New Advances in Transcendence Theory, A. Baker, ed, Cambridge University Press, 1988, 248-262.
32. K. A. Mihaïlova: The occurrence problem for a direct product of groups (in Russian), Dokl. Akad. Nauk 119 (1958), 1103-1105.
33. G. Ostheimer: private communication. [Pa]
34. M. S. Paterson: Undecidability in 3 by 3 matrices, J. of Math. and Physics 49 (1970), 105-107.
35. L. Rónyai: Computing the structure of finite algebras, Journal of Symbolic Computation 9, (1990), 355-373.
36. A. Schrijver: Theory of Linear and Integer Programming, Wiley, New York, 1986.
37. J. T. Schwartz: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701-717.
38. J. Tits: Free subgroups in linear groups, J. Algebra 20 (1972), 250-270.
39. B. L. van der Waerden: Algebra, Vol. II., Springer-Verlag 1991.
40. R. E. Zippel: Probabilistic algorithms for sparse polynomials, Proc. EUROSAM 79, L.N.C.S. 72 (1979), Springer-Verlag, pp. 216-226.