Separating linear forms for bivariate systems
From MaRDI portal
Publication:2963224
DOI10.1145/2465506.2465518zbMath1360.68923arXiv1303.5041OpenAlexW2164300104MaRDI QIDQ2963224
Sylvain Lazard, Yacine Bouzidi, Marc Pouget, Fabrice Rouillier
Publication date: 10 February 2017
Published in: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.5041
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items (3)
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of computing with planar algebraic curves
This page was built for publication: Separating linear forms for bivariate systems