On Isolating Roots in a Multiple Field Extension
From MaRDI portal
Publication:6081956
DOI10.1145/3597066.3597107arXiv2306.04271WikidataQ131124586 ScholiaQ131124586MaRDI QIDQ6081956
Christina Katsamaki, Fabrice Rouillier
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.04271
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for computing triangular decomposition of polynomial systems
- Separating linear forms and rational univariate representations of bivariate systems
- Bivariate triangular decompositions in the presence of asymptotes
- Real solution isolation with multiplicity of zero-dimensional triangular systems
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- A worst-case bound for topology computation of algebraic curves
- Univariate real root isolation in an extension field and applications
- An algorithm for isolating the real solutions of semi-algebraic systems
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Clustering complex zeros of triangular systems of polynomials
- Bounds for polynomials on algebraic numbers and application to curve topology
- Separation bounds for polynomial systems
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- On the complexity of computing with planar algebraic curves
- Fast multivariate multi-point evaluation revisited
- Real Root Isolation of Regular Chains
- On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
- Sparse Rational Univariate Representation
- Univariate real root isolation in multiple extension fields
- Algorithms in real algebraic geometry
- Counting solutions of a polynomial system locally and exactly
This page was built for publication: On Isolating Roots in a Multiple Field Extension
