Pages that link to "Item:Q531917"
From MaRDI portal
The following pages link to The conjugacy problem in the Grigorchuk group is polynomial time decidable. (Q531917):
Displaying 7 items.
- Quadratic equations in the Grigorchuk group. (Q260112) (← links)
- Log-space conjugacy problem in the Grigorchuk group (Q524647) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- The conjugacy problem in automaton groups is not solvable. (Q1936130) (← links)
- Key agreement based on automaton groups (Q2178747) (← links)
- Solving the Conjugacy Decision Problem via Machine Learning (Q4960480) (← links)
- Linear time algorithm for the conjugacy problem in the first Grigorchuk group (Q5002196) (← links)
