most citedThe Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.GR2008★ 2 cited

The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

I. Lysenok, A. Myasnikov, A. Ushakov

In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.