On the complexity of intersection and conjugacy problems in free groups
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 32 (3) , 279-295
- https://doi.org/10.1016/0304-3975(84)90046-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The Nielsen reduction and P-complete problems in free groupsTheoretical Computer Science, 1984
- On finitely generated subgroups of free groupsArchiv der Mathematik, 1977
- Word Problems Solvable in LogspaceJournal of the ACM, 1977
- Conjugacy of subgroups of a free groupAlgebra and Logic, 1969
- On the Intersection of Finitely Generated Free GroupsJournal of the London Mathematical Society, 1954