Rump, Siegfried M.Siegfried M.Rump2008-03-202008-03-201979Mathematics of computation 33 (1979) 145, 327-36http://tubdok.tub.tuhh.de/handle/11420/305The minimum root separation of an arbitrary polynomial P is defined as the minimum of the distances between distinct (real or complex) roots of P. Some asymptotically good lower bounds for the root separation of p are given, where P may have multiple zeros. There are applications in the analysis of complexity of algorithms and in the theory of algebraic and transcendental numbers.enhttp://doku.b.tu-harburg.de/doku/lic_ohne_pod.phpJournal Article2008-04-02urn:nbn:de:gbv:830-tubdok-376410.15480/882.30311420/30510.15480/882.303930767773Journal Article