We study the computational complexity of the Word Problem (WP) in free solvable groups S r,d , where r ≥ 2 is the rank and d ≥ 2 is the solvability class of the group. It is known that the Magnus embedding of S r,d into matrices provides a polynomial time decision algorithm for WP in a fixed group S r,d . Unfortunately, the degree of the polynomial grows together with d, so the uniform algorithm is not polynomial in d. In this paper we show that WP has time complexity O(rn log 2 n) in S r,2 ,

more »

... d O(n 3 rd) in S r,d for d ≥ 3. However, it turns out, that a seemingly close problem of computing the geodesic length of elements in S r,2 is NP -complete. We prove also that one can compute Fox derivatives of elements from S r,d in time O(n 3 rd); in particular, one can use efficiently the Magnus embedding in computations with free solvable groups. Our approach is based on such classical tools as the Magnus embedding and Fox calculus, as well as on relatively new geometric ideas; in particular, we establish a direct link between Fox derivatives and geometric flows on Cayley graphs.