The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Complexity of computation on real algebraic numbers
Journal of Symbolic Computation
Hi-index | 5.23 |
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(sd^2log^3d), where s is the number of polynomials involved and d is a bound for their degree. Previously known complexity results involve a factor of d^2^.^3^7^6.