The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The conjugacy problem in the Grigorchuk group is polynomial time decidable. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The conjugacy problem in the Grigorchuk group is polynomial time decidable. |
scientific article |
Statements
The conjugacy problem in the Grigorchuk group is polynomial time decidable. (English)
0 references
21 April 2011
0 references
conjugacy problem
0 references
Grigorchuk group
0 references
conjugacy trees
0 references
polynomial time complexity
0 references
decision algorithms
0 references
0 references
