论文信息 - Word Problems Solvable in Logspace

Word Problems Solvable in Logspace

Extending a result of Rabin, It Is shown that the word problem for hnear groups (groups of matrices) over a field of characteristic 0 is solvable in (deterministic) logspace As an apphcatlon of this result, it follows that the word problem for free groups and hence the membership problem for the two-sided Dyck language are solvable in logspace

Richard J. Lipton | Yechezkel Zalcstein | R. Lipton | Y. Zalcstein

[1] Journal of the Association for Computing Machinery , 1961, Nature.

[2] W. Ledermann. Lectures in Abstract Algebra : vol. III, Theory of Fields and Galois Theory. By N. Jacobson. Pp. xi, 323. 76s. (Van Nostrand) , 1966 .

[3] Richard J. Lipton. Polynomials with 0-1 coefficients that are hard to evaluate , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[4] Frederick N. Springsteel,et al. Language Recognition by Marking Automata , 1972, Inf. Control..

[5] J. Rotman. The theory of groups : an introduction , 1966 .

[6] Frank B. Cannonito,et al. Hierarchies of Computable groups and the word problem , 1966, Journal of Symbolic Logic.

[7] M. Rabin. Computable algebra, general theory and theory of computable fields. , 1960 .

[8] Charles F. Miller. On Group-Theoretic Decision Problems and Their Classification. , 1971 .