The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

Abstract

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

arXiv comment17 pages

Cited by in corpus (1)

• Polynomial time conjugacy in wreath products and free solvable groups