The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
In this paper we prove that the Conjugacy Problem in the Grigorchuk group $Γ$ has polynomial time complexity.
math.GR↗
arXiv subjects
I. Lysenok
Publications and source records attributed to I. Lysenok.