On the complexity of solving a bivariate polynomial system

DOI10.1145/2442829.2442854zbMath1308.68169arXiv1104.4954OpenAlexW2074967544MaRDI QIDQ5244530

Pavel Emeliyanenko, Michael Sagraloff

Publication date: 27 March 2015

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical computation of roots of polynomial equations (65H04)

Related Items (13)

A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers ⋮ Continuous amortization and extensions: with applications to bisection-based root isolation ⋮ On the complexity of quadratic programming with two quadratic constraints ⋮ A certified numerical algorithm for the topology of resultant and discriminant curves ⋮ On the complexity of computing the topology of real algebraic space curves ⋮ Computing the topology of a plane or space hyperelliptic curve ⋮ Exact symbolic-numeric computation of planar algebraic curves ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Separating linear forms and rational univariate representations of bivariate systems ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ 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: On the complexity of solving a bivariate polynomial system