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 $S_{r,d}$, where $r\ge 2$ is the rank and $d\ge 2$ is the solvability class of the group.…