Complexity of the resolution of parametric systems of polynomial equations and inequations

DOI10.1145/1145768.1145810zbMath1356.14050OpenAlexW2089113283MaRDI QIDQ2958995

Guillaume Moroz

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00078795/file/brouillon_rr1.pdf

zbMATH Keywords

complexityeliminationparametric polynomial systemdiscriminant variety

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Real algebraic and real-analytic geometry (14P99)

Related Items (6)

Solving parametric polynomial systems ⋮ Invariant algebraic sets and symmetrization of polynomial systems ⋮ Complexity of solving parametric polynomial systems ⋮ On computing absolutely irreducible components of algebraic varieties with parameters ⋮ A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications ⋮ Dynamic balancing of planar mechanisms using toric geometry

This page was built for publication: Complexity of the resolution of parametric systems of polynomial equations and inequations