On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

DOI10.1145/2930889.2930934zbMath1362.13032arXiv1604.08944OpenAlexW2344308227MaRDI QIDQ2985822

Michael Sagraloff, Cornelius Brand

Publication date: 10 May 2017

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

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

zbMATH Keywords

polynomial system solvingbit complexityresultant computationseparating formcertified algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Solving polynomial systems; resultants (13P15)

Related Items (5)

An algebraic framework for computing the topology of offsets to rational curves ⋮ Strong $\mu$-Bases for Rational Tensor Product Surfaces and Extraneous Factors Associated to Bad Base Points and Anomalies at Infinity ⋮ On Isolating Roots in a Multiple Field Extension ⋮ Counting solutions of a polynomial system locally and exactly ⋮ On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces

This page was built for publication: On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection