@inproceedings{981e2c348a884d4a8c97bcfbda12e5b7,

title = "Almost tight recursion tree bounds for the descartes method",

abstract = "We give a unified ({"}basis free{"}) framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for polynomials in the power basis as well as its analog in the Bernstein basis. We then give a new bound on the size of the recursion tree in the Descartes method for polynomials with real coefficients. Applied to polynomials A(X) = ∑i=0 n aiXi with integer coefficients |a i| < 2L, this yields a bound of O(n(L + logn)) on the size of recursion trees. We show that this bound is tight for L = Ω(log n), and we use it to derive the best known bit complexity bound for the integer case.",

keywords = "Bernstein basis, Davenport-Mahler bound, Descartes method, Descartes rule of signs, Polynomial real root isolation",

author = "Arno Eigenwillig and Vikram Sharma and Yap, {Chee K.}",

year = "2006",

doi = "10.1145/1145768.1145786",

language = "English (US)",

isbn = "1595932763",

series = "Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC",

publisher = "Association for Computing Machinery (ACM)",

pages = "71--78",

booktitle = "Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC 2006",

address = "United States",

note = "International Symposium on Symbolic and Algebraic Computation, ISSAC 2006 ; Conference date: 09-07-2006 Through 12-07-2006",

}