Almost tight recursion tree bounds for the Descartes method
Work
Year: 2006
Type: article
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 pol... more
Authors Arno Eigenwillig, Vikram Sharma, Chee Yap
Institution Max Planck Institute for Informatics
Cites: 24
Cited by: 96
Related to: 10
FWCI: 10.87
Citation percentile (by year/subfield): 93.9
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green