Improved algorithm for computing separating linear forms for bivariate systems

DOI10.1145/2608628.2608668zbMath1325.68267arXiv1405.4740OpenAlexW2130329973MaRDI QIDQ3452380

Sylvain Lazard, Yacine Bouzidi, Marc Pouget, Guillaume Moroz, Fabrice Rouillier

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.4740

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Related Items (4)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Solving bivariate systems using rational univariate representations ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ On the complexity of computing with planar algebraic curves

Uses Software

• modpn
• Jordan

Cites Work

• Unnamed Item
• Unnamed Item
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic

This page was built for publication: Improved algorithm for computing separating linear forms for bivariate systems