Solving bivariate systems using Rational Univariate Representations
Authors:
- Yacine BouzidiYBYacine Bouzidi
- Sylvain LazardSLSylvain Lazard
- Guillaume MorozGMGuillaume Moroz
- Marc PougetMPMarc Pouget
- Fabrice RouillierFRFabrice Rouillier
- Michael SagraloffMSMichael Sagraloff
- 1 December 2016
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 37, 34-75
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Root refinement for real polynomials using quadratic interval refinementJournal of Computational and Applied Mathematics, 2015
- Separating linear forms and Rational Univariate Representations of bivariate systemsJournal of Symbolic Computation, 2015
- On the complexity of computing with planar algebraic curvesJournal of Complexity, 2015
- The modpn library: Bringing fast polynomial arithmetic into MapleJournal of Symbolic Computation, 2011
- On the asymptotic and practical complexity of solving bivariate systems over the realsJournal of Symbolic Computation, 2009
- PRIMES is in PAnnals of Mathematics, 2004
- Fast Algorithms for Zero-Dimensional Polynomial Systems using DualityApplicable Algebra in Engineering, Communication and Computing, 2003
- An elementary approach to subresultants theoryJournal of Symbolic Computation, 2003
- A Gröbner Free Alternative for Polynomial System SolvingJournal of Complexity, 2001
- An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane CurveJournal of Complexity, 1996