On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection-Reference-Cited by-同舟云学术

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

Published:2016-07-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation
language:
Short-container-title:

Author:

Brand Cornelius¹,Sagraloff Michael²

Affiliation:

1. Saarland University, Saarbrücken, Germany

2. Max-Planck-Institut f\, Saarbrücken, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2930889.2930934

Reference30 articles.

1. R. Becker M. Sagraloff V. Sharma and C. Yap. A simple near-optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration. CoRR abs/1509.06231 2015. R. Becker M. Sagraloff V. Sharma and C. Yap. A simple near-optimal subdivision algorithm for complex root isolation based on the pellet test and newton iteration. CoRR abs/1509.06231 2015.

2. C. Brand and M. Sagraloff. On the complexity of solving zero-dimensional polynomial systems via projection. CoRR abs/1604.08944 2016. C. Brand and M. Sagraloff. On the complexity of solving zero-dimensional polynomial systems via projection. CoRR abs/1604.08944 2016.

3. Generalised characteristic polynomials

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Counting solutions of a polynomial system locally and exactly;Journal of Symbolic Computation;2024-01

2. On the Complexity of Chow and Hurwitz Forms;ACM Communications in Computer Algebra;2023-12

3. Computing the Non-properness Set of Real Polynomial Maps in the Plane;Vietnam Journal of Mathematics;2023-10-04

4. On Isolating Roots in a Multiple Field Extension;Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation;2023-07-24

5. On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces;Trends in Mathematics;2022