The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
arXiv:0808.2502
Abstract
In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.
17 pages
arXiv:0808.2502
In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.
17 pages