The complexity of solving equations over finite groups

Information and Computation

Volumn 178, Issue 1, 2002, Pages 253-262

  Goldmann, Mikael ^a   Russell, Alexander ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b University of Connecticut   (United States)

Author keywords

Automata; Computational complexity; Equations; Groups

Indexed keywords

FINITE AUTOMATA; GRAPH THEORY; LINEAR EQUATIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

ABELIAN GROUP; FINITE GROUPS; GRAPH COLORING; NILPOTENT GROUPS; NONUNIFORM AUTOMATA;

COMPUTATIONAL COMPLEXITY;

EID: 0037057862     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93173-1     Document Type: Article

References (10)

1. Barrington, D., McKenzie, P., Moore, C., Tesson, P., and Thérien, D. (2000), Equation satisfiability and program satisfiability for finite monoids, in "Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science," Slovak Republic, pp. 172-181.
2. Barrington, D. A. (1986), "Bounded-Width Branching Programs," Ph.D. thesis, Massachusetts Institute of Technology.
3. Barrington, D. A. M., Straubing, H., and Thérien, D. (1990), Non-uniform automata over groups, Inform. and Comput. 89, 109-132.
4. Engebretsen, L., Holmerin, J., and Russell, A. (2002), Inapproximability results for equations over finite groups, in "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming," Málaga, Spain.
5. Goldmann, M., and Russell, A. (1999), The computational complexity of solving systems of equations over finite groups, in "Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity," Atlanta, GA, pp. 80-86.
6. Graham, R. L., Rothschild, B. L., and Spencer, J. H. (1990), "Ramsey Theory," Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York.
7. Håstad, J. (2001), Some optimal inapproximability results, J. Assoc. Comput. Mach. 48(4), 798-859.
8. Hungerford, T. W. (1974), "Algebra," Springer-Verlag, Berlin.
9. Maurer, W. D., and Rhodes, J. L. (1965), A property of finite simple non-abelian groups, Proc. Amer. Math. Soc. 16, 552-554.
10. Péladeau, P., and Thérien, D. (1988), Sur les langages reconnus par des groupes nilpotents, C. R. Acad. Sci. Paris Sér. I Math, 306(2), 93-95, a translation of this article into English appears as "Electronic Colloquium on Computational Complexity," Technical Report TR01-040.