2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
Jeremy Macdonald
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word pr…