The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/167290In this paper we prove that the Conjugacy Problem in the Grigorchuk group $Γ$ has polynomial time complexity.17 pagesGroup Theory20F10The Conjugacy Problem in the Grigorchuk Group is polynomial time decidabletext