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 the normal view instead:
scientific article; zbMATH DE number 5880966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The conjugacy problem in the Grigorchuk group is polynomial time decidable. |
scientific article; zbMATH DE number 5880966 |
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
0.8122637867927551
0 references
0.7881119847297668
0 references
0.7869446873664856
0 references
0.7820424437522888
0 references
0.7819522023200989
0 references
