A polynomial-time algorithm for the topological type of a real algebraic curve
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the worst-case arithmetic complexity of approximating zeros of systems of polynomials
SIAM Journal on Computing
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Singular points of algebraic curves
Journal of Symbolic Computation
Proceedings of the third conference on Computers and mathematics
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
Solving projective complete intersection faster
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
Sylvester—Habicht sequences and fast Cauchy index computation
Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Efficient topology determination of implicitly defined algebraic plane curves
Computer Aided Geometric Design
Theoretical Computer Science - Latin American theoretical informatics
A modular GCD algorithm over number fields presented with multiple extensions
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Modern Computer Algebra
On the exact computation of the topology of real algebraic curves
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
The implicit structure of ridges of a smooth parametric surface
Computer Aided Geometric Design
On the complexity of real solving bivariate systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast and exact geometric analysis of real algebraic plane curves
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Real solving of bivariate polynomial systems
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Univariate real root isolation in an extension field
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
Journal of Symbolic Computation
The nearest complex polynomial with a zero in a given complex domain
Theoretical Computer Science
A worst-case bound for topology computation of algebraic curves
Journal of Symbolic Computation
Efficient two-dimensional pattern matching with scaling and rotation and higher-order interpolation
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
On the complexity of solving a bivariate polynomial system
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Univariate real root isolation in multiple extension fields
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Separating linear forms for bivariate systems
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
From approximate factorization to root isolation
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the boolean complexity of real root refinement
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
On the complexity of solving bivariate systems: the case of non-singular solutions
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Journal of Symbolic Computation
Hi-index | 0.00 |
This paper is concerned with exact real solving of well-constrained, bivariate polynomial systems. The main problem is to isolate all common real roots in rational rectangles, and to determine their intersection multiplicities. We present three algorithms and analyze their asymptotic bit complexity, obtaining a bound of O@?"B(N^1^4) for the purely projection-based method, and O@?"B(N^1^2) for two subresultant-based methods: this notation ignores polylogarithmic factors, where N bounds the degree, and the bitsize of the polynomials. The previous record bound was O@?"B(N^1^4). Our main tool is signed subresultant sequences. We exploit recent advances on the complexity of univariate root isolation, and extend them to sign evaluation of bivariate polynomials over algebraic numbers, and real root counting for polynomials over an extension field. Our algorithms apply to the problem of simultaneous inequalities; they also compute the topology of real plane algebraic curves in O@?"B(N^1^2), whereas the previous bound was O@?"B(N^1^4). All algorithms have been implemented in maple, in conjunction with numeric filtering. We compare them against fgb/rs, system solvers from synaps, and maple libraries insulate and top, which compute curve topology. Our software is among the most robust, and its runtimes are comparable, or within a small constant factor, with respect to the C/C++ libraries.