The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
classification
🧮 math.GR
keywords
conjugacygrigorchukgrouppolynomialproblemtimecomplexitydecidable
read the original abstract
In this paper we prove that the Conjugacy Problem in the Grigorchuk group $\Gamma$ has polynomial time complexity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.