The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable - Mathematics > Group TheoryReport as inadecuate




The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable - Mathematics > Group Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: In this paper we prove that the Conjugacy Problem in the Grigorchuk group$\Gamma$ has polynomial time complexity.



Author: I. Lysenok, A. Myasnikov, A. Ushakov

Source: https://arxiv.org/







Related documents