b'@misc{ms-detbitdesc-09,'b'\nTITLE = {Isolating Real Roots of Real Polynomials},\nAUTHOR = {Mehlhorn, Kurt and Sagraloff, Michael},\nLANGUAGE = {eng},\nISBN = {978-1-60558-609-0},\nDOI = {10.1145/1576702.1576737},\nLOCALID = {Local-ID: C1256428004B93B8-AE8C9A24B63BC4A8C125759E0029B4A4-ms-detbitdesc-09},\nPUBLISHER = {ACM},\nADDRESS = {New York, NY},\nYEAR = {2009},\nDATE = {2009},\nABSTRACT = {We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the randomized bitstream-Descartes algorithm of~\\citet{BitstreamDescartes}. Besides being deterministic, the algorithm is also somewhat simpler to analyze.},\nBOOKTITLE = {Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC 2009)},\nPAGES = {247--254},\n}\n'