| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437343 | Theoretical Computer Science | 2011 | 6 Pages |
Abstract
We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem, both in the univariate and multivariate setting. In particular, this enables us to improve the complexity bound for sign determination in the univariate case to O(sd2log3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d2.376.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
