Faster real root decision algorithm for symmetric polynomials
From MaRDI portal
Publication:6081968
DOI10.1145/3597066.3597097arXiv2306.03855OpenAlexW4379933108MaRDI QIDQ6081968
Éric Schost, Thi Xuan Vu, George Labahn, Mohab Safey El Din, Cordian Riener
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.03855
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
- On the degree and half-degree principle for symmetric polynomials
- On the intrinsic complexity of point finding in real singular hypersurfaces
- Solving systems of polynomial inequalities in subexponential time
- Real quantifier elimination is doubly exponential
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Solving a system of algebraic equations with symmetries
- Polar varieties, real equation solving, and data structures: the hypersurface case
- On the positivity of symmetric polynomial functions. I: General results
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Symmetry groups, semidefinite programs, and sums of squares
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Computing critical points for invariant algebraic systems
- Solving determinantal systems using homotopy techniques
- Intrinsic complexity estimates in polynomial optimization
- Cylindrical algebraic decomposition with equational constraints
- Degeneracy loci and polynomial equation solving
- Generalized polar varieties: geometry and algorithms
- Cylindrical algebraic decomposition using validated numerics
- Computing cylindrical algebraic decomposition via triangular decomposition
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- On the Complexity of Computing Critical Points with Gröbner Bases
- Critical Point Computations on Smooth Varieties
- On the Theoretical and Practical Complexity of the Existential Theory of Reals
- On the combinatorial and algebraic complexity of quantifier elimination
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Real Root Finding for Equivariant Semi-algebraic Systems
- On the bit complexity of finding points in connected components of a smooth real hypersurface
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Critical points and Gröbner bases
- Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane
- A Note on Proper Polynomial Maps
- Triangular decomposition of semi-algebraic systems
- Algorithms in invariant theory
- Algorithms in real algebraic geometry
- A Gröbner free alternative for polynomial system solving
- Polar varieties and efficient real elimination
- Resultant of an equivariant polynomial system with respect to the symmetric group
