We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact eld K. More precisely, given a precision d , and a polynomial Q whose coecients are power series in x , the algorithm computes a representation of all power series f (x) such that Q(f (x)) = 0 mod xd . e algorithm works unconditionally, in particular also with multiple roots, where N...