Zeros, multiplicities, and idempotents for zero-dimensional systems
Algorithms in algebraic geometry and applications
An improved upper complexity bound for the topology computation of a real algebraic plane curve
Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
Asymptotically fast computation of subresultants
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
A Gröbner free alternative for polynomial system solving
Journal of Complexity
An elementary approach to subresultants theory
Journal of Symbolic Computation
Modern Computer Algebra
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
The modpn library: Bringing fast polynomial arithmetic into Maple
Journal of Symbolic Computation
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Rational univariate representations of bivariate systems and applications
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex) solutions of the system. In other words, a separating linear form defines a shear of the coordinate system that sends the algebraic system in generic position, in the sense that no two distinct solutions are vertically aligned. The computation of such linear forms is at the core of most algorithms that solve algebraic systems by computing rational parameterizations of the solutions and, moreover, the computation of a separating linear form is the bottleneck of these algorithms, in terms of worst-case bit complexity. Given two bivariate polynomials of total degree at most d with integer coefficients of bitsize at most τ, our algorithm computes a separatin linear form in ÕB(d8+d7τ+d5τ2) bit operations in the worst case, where the previously known best bit complexity for this problem was ÕB(d10+d9τ) (whereÕ refers to the complexity where polylogarithmic factors are omitted and ÕB refers to the bit complexity)