9 citations · 25 across the 14 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
math.GR2008★ 2 cited
Krull dimension of solvable groups
A. Myasnikov, N. Romanovskiy
In this paper we prove that free solvable groups have finite Krull dimension. In fact, this is true for much wider class of solvable groups, termed rigid groups. Along the way we s…
math.GR2008★ 2 cited
The Conjugacy Problem in the Grigorchuk Group is polynomial time decidable
I. Lysenok, A. Myasnikov, A. Ushakov
In this paper we prove that the Conjugacy Problem in the Grigorchuk group has polynomial time complexity.
math.GR2008★ 1 cited
The Word and Geodesic Problems in Free Solvable Groups
A. Myasnikov, V. Roman'kov, A. Ushakov +1
We study the computational complexity of the Word Problem (WP) in free solvable groups , where is the rank and is the solvability class of the group.…