The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Group Theory, 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/167290

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0808.2502
 http://arxiv.org/abs/0808.2502

Collections

arXiv