Complexity of the A B C problem

SIAM Journal on Computing

Volumn 29, Issue 6, 2000, Pages 1878-1888

  Cai, Jin Yi ^a   Lipton, Richard J ^b   Zalcstein, Yechezkel ^c  

^a UNIVERSITY AT BUFFALO   (United States)

^b Princeton University   (United States)

^c NATIONAL SCIENCE FOUNDATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL-TIME ALGORITHMS;

ALGORITHMS;

EID: 0034478926     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794276853     Document Type: Article

References (43)

1. S. I. ADYAN, Algorithmic unsolvability of problems of recognition of certain properties of groups, Dokalady Akad. Nauk SSSR, 103 (1955), pp. 533-535 (in Russian).
2. L. BABAI, Trading group theory for randomness, in Proceedings of the 17th Symposium on the Theory of Computing, Providence, RI, 1985, pp. 421-429.
3. L. BABAI, E. LUKS, AND A. SERESS, Permutation groups in NC, in Proceedings of the 19th Symposium on the Theory of Computing, New York, 1987, pp. 272-282.
4. L. BABAI, G. COOPERMAN, L. FINKELSTEIN, E. LUKS, AND A. SERESS, Fast Monte Carlo algorithms for permutation groups, in Proceedings of the 23rd Symposium on the Theory of Computing, New Orleans, 1991, pp. 90-100.
5. L. BABAI AND E. SZEMEREDI, On the complexity of matrix group problems I, in Proceedings of the 25th Symposium on the Foundation of Computer Science, Singer Island, FL, 1984, pp. 229-240.
6. R. BEALS AND L. BABAI, Las Vegas algorithms for matrix groups, in Proceedings of the 33rd Symposium on the Foundation of Computer Science, Palo Alto, CA, 1993, pp. 427-436.
7. L. BABAI, R. BEALS, J. CAI, G. IVANOS, AND E. LUKS, Multiplicative equations over commuting matrices, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Atlanta, GA, 1996, pp. 498-507.
8. M. BEAUDRY, Membership testing in commutative transformation semigroups, Inform. and Comput., 79 (1988), pp. 84-93.
9. J.-C. BIRGET, S. MARGOLIS, J. MEAKIN, AND P. WEIL, PSPACE-completeness of certain algorithmic problems on the subgroups of free groups, in Proceedings International Comput. Algorithms Lang. Programming, 1994, pp. 274-285.
10. P. E. BLANKSBY AND H. L. MONTGOMERY, Algebraic integers near the unit circle, Acta Arith., 18 (1971), pp. 355-369.
11. W. W. BOONE, The word problem, Ann. of Math., 70 (1952), pp. 207-265.
12. J. CAI, Computing Jordan normal forms exactly for commuting matrices in polynomial time, Internat. J. Foundations Comput. Sci., 5 (1994), pp. 293-302.
13. J. CAI, R. LIPTON, AND Y. ZALCSTEIN, Complexity of the membership problem for 2-generated commutative semigroups of rational matrices, in Proceedings Foundation of Computer Science, Santa Fe, NM, 1994, pp. 135-142.
14. M. CURZIO, P. LONGOBARDI, AND M. MAI, Su di un problema combinatorio in teoria dei gruppi, Atti Lincei VIII 74, (1983), pp. 136-142.
15. M. FURST, J. HOPCROFT, AND E. LUKS, Polynomial time algorithms for permutation groups, in Proceedings Foundation of Computer Science, 1980, pp. 60-78
16. M. GARZON AND Y. ZALCSTEIN, Complexity of Grigorchuk groups with application to cryptography, Theoret. Comput. Sci., 88 (1991), pp. 83-98.
17. M. GARZON AND Y. ZALCSTEIN, On permutation properties in groups and semigroups, Semigroup Forum, 35 (1987), pp. 337-351.
18. G. GE, Testing equalities of multiplicative representations in polynomial time, in Proceedings Foundation of Computer Science, 1993, pp. 422-426.
19. G. GE, Algorithms Related to the Multiplicative Representations of Algebraic Numbers, Ph.D. dissertation, Department of Mathematics, University of California at Berkeley, Berkeley, CA, 1993.
20. R. I. GRIGORCHUK, Degrees of growth of finitely generated groups and the theory of invariant means, Math. USSR Izvestiya, 25 (1985), pp. 259-300.
21. I. KAPLANSKY, Fields and Rings, 2nd ed., University of Chicago Press, Chicago, IL, 1972.
22. D. E. KNUTH, Notes on Efficient Representation of Permutation Groups, manuscript, 1981.
23. M. KROM, An unsolvable problem with products of matrices, Math. Systems Theory, 14 (1981), pp. 335-337.
24. L. KOPYTOV, Solvability of the occurrence problem infinitely generated soluble groups of matrices over the field of algebraic numbers, Algebra and Logic, 7 (1968), pp. 388-393.
25. D. KOZEN, Lower bounds for natural proof systems, in Proceedings Foundation of Computer Science, Providence, RI, 1977, pp. 254-266.
26. R. KANNAN, The Size of Numbers in the Analysis of Certain Algorithms, Ph.D. dissertation, Operations Research Dept., Cornell University, Ithaca, NY, 1980.
27. R. KANNAN AND A. BACHEM, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput., 8 (1979), pp. 499-507.
28. R. KANNAN AND R. LIPTON, The orbit problem is decidable, in Proceedings of the 12th Symposium on the Theory of Computing, Los Angeles, CA, 1980, pp. 252-261. See also Polynomial-time algorithms for the orbit problem, JACM, 33 (1986), pp. 808-821.
29. R. KANNAN AND R. LIPTON, The orbit problem is decidable, in Proceedings of the 12th Symposium on the Theory of Computing, Los Angeles, CA, 1980, pp. 252-261. See also Polynomial-time algorithms for the orbit problem, JACM, 33 (1986), pp. 808-821.
30. R. KANNAN, A. K. LENSTRA, AND L. LOVÁSZ, Polynomial factorization and non-randomness of bits of algebraic numbers and certain transcendental numbers, Math. Comp., 50 (1988), pp. 235-250.
31. H. W. LENSTRA, Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
32. A. K. LENSTRA, H. W. LENSTRA, AND L. LOVÁSZ, Factoring polynomials with rational coefficients, Math. Ann., 261 (1982), pp. 515-534.
33. S. LANDAU, personal communication, University of Massachusetts, Amherst, MA, 1994.
34. R. LIPTON AND Y. ZALCSTEIN, Word problems solvable in logspace, JACM, 24 (1977), pp. 522-526.
35. L. LOVASZ, An Algorithmic Theory of Numbers, Graphs and Convexity, SIAM, Philadelphia, 1986.
36. E. LUKS, Computing in solvable matrix groups, in Proceedings Foundation of Computer Science, Pittsburgh, PA, 1992, pp. 111-120.
37. D. W. MASSER, Linear relations on algebraic groups, in New Advances in Transcendence Theory, A. Baker, ed., Cambridge University Press, Cambridge, UK, 1988, pp. 248-262.
38. K. A. MIHAILOVA, The occurrence problem for a direct product of groups, Dokl. Akad. Nauk, 119 (1958), pp. 1103-1105.
39. P. S. NOVIKOV, On the algorithmic unsolvability of the problem of equality of words in group theory, Trudy Mat. Inst. Akad. Nauk SSSR, 44 (1955), pp. 1-144 (in Russian).
40. M. S. PATERSON, Undecidability in 3 by 3 matrices, J. Math. Phys., 49 (1970), pp. 105-107.
41. M. RABIN, Recursive unsolvability of group theoretic problems, Ann. Math., 67 (1958), pp. 172-194.
42. M. RABIN, Computable algebra, general theory and theory of computable fields, Trans. Amer. Math. Soc., 95 (1960), pp. 341-360.
43. H. U. SIMON, Word problems for groups and context-free languages, in Foundations of Computation Theory, Lecture Notes in Comput. Sci., Springer-Verlag, New York, 1979, pp. 417-422.