The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
Group Theory
2008-08-20 v1
Abstract
In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.
Keywords
Cite
@article{arxiv.0808.2502,
title = {The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable},
author = {I. Lysenok and A. Myasnikov and A. Ushakov},
journal= {arXiv preprint arXiv:0808.2502},
year = {2008}
}
Comments
17 pages