Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Time/space tradeoffs for reversible computation;Bennett;SIAM J. Comput.,1989
2. Theory of Codes;Berstel,1984
3. The complexity of the word problem for semigroups and the Higman embedding theorem;Birget;Internat. J. Algebra Comput.,1998
4. J.C. Birget, Infinite string rewrite systems and complexity, J. Symbolic Computation (to appear).
5. J.C. Birget, A. Ol'shansky, E. Rips, M.V. Sapir, Isoperimetric functions of groups and computational complexity of the word problem, submitted.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Proof Complexity;2019-03-28
2. The Nature of Proof Complexity;Proof Complexity;2019-03-28
3. Model Theory and Lower Bounds;Proof Complexity;2019-03-28
4. Hard Tautologies;Proof Complexity;2019-03-28
5. Index;Proof Complexity;2019-03-28