The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

Simple item page
dc.creatorLysenok, I.
dc.creatorMyasnikov, A.
dc.creatorUshakov, A.
dc.date2008-08-18
dc.date.accessioned2026-07-07T09:57:18Z
dc.date.available2026-07-07T09:57:18Z
dc.descriptionIn this paper we prove that the Conjugacy Problem in the Grigorchuk group $Γ$ has polynomial time complexity.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/0808.2502
dc.identifierhttp://arxiv.org/abs/0808.2502
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167290
dc.subjectGroup Theory
dc.subject20F10
dc.titleThe Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
dc.typetext

Files

Collections

arXiv