A taxonomy of problems with fast parallel algorithms
Information and Control
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Languages that capture complexity classes
SIAM Journal on Computing
On the relative complexity of some languages in NC
Information Processing Letters
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
String-rewriting systems
Parallel algorithms for group word problems
Parallel algorithms for group word problems
Word Problems Solvable in Logspace
Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report)
Proceedings on Mathematical Foundations of Computer Science
Word Problems and Confluence Problems for Restricted Semi-Thue Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
| Hi-index | 0.00 |
We prove that the word problem for every monoid presented by a fixed 2-homogeneous semi-Thue system can be solved in log-space, which generalizes a result of Lipton and Zalcstein for free groups. The uniform word problem for the class of all 2-homogeneous semi-Thue systems is shown to be complete for symmetric log-space.