Abstract
In this paper we prove that the conjugacy problem in the Grigorchuk group Γ has polynomial time complexity. This solves a problem posed by Grigorchuk rather unexpectedly.
Original language | English |
---|---|
Pages (from-to) | 813-833 |
Number of pages | 21 |
Journal | Groups, Geometry, and Dynamics |
Volume | 4 |
Issue number | 4 |
DOIs | |
State | Published - 2010 |
Keywords
- Conjugacy problem
- Grigorchuk group