On the complexity of computing real radicals of polynomial systems

DOI10.1145/3208976.3209002MaRDI QIDQ5120216zbMATH OpenOpenAlexWikidataFDO

Authors Zhi-Hong Yang, Lihong Zhi, Mohab Safey El Din

Publication date 9 September 2020

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

Full work available at URL https://hal.inria.fr/hal-01956596/file/SaYaZhi18.pdf

zbMATH Keywords

polynomial systemreal algebraic geometryreal radical

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Computational aspects of higher-dimensional varieties (14Q15) Analysis of algorithms (68W40)

Recommendations

• Computing real radicals and S-radicals of polynomial systems
• Computation of real radicals of polynomial ideals. II
• scientific article; zbMATH DE number 421675
• scientific article; zbMATH DE number 833249
• Computation of generalized real radicals of polynomial ideals

Cited in

(18)

• Computation of generalized real radicals of polynomial ideals
• Complexity of finding irreducible components of a semialgebraic set
• Computation of real radicals of polynomial ideals. II
• Global optimization of polynomials over real algebraic sets
• On the bit complexity of polynomial system solving
• Smooth points on semi-algebraic sets
• An improvement of the rational representation for high-dimensional systems
• Computing real radicals and S-radicals of polynomial systems
• Probabilistic algorithm for computing the dimension of real algebraic sets
• Complexity Analysis of Root Clustering for a Complex Polynomial
• scientific article; zbMATH DE number 421675 (Why is no real title available?)
• Computing the real isolated points of an algebraic hypersurface
• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
• Tensor manifold with Tucker rank constraints
• On the effective Putinar's Positivstellensatz and moment approximation
• A Direttissimo Algorithm for Equidimensional Decomposition
• Sampling smooth points on real algebraic sets using perturbations
• On the complexity of computing the logarithm and square root functions on a complex domain

This page was built for publication: On the complexity of computing real radicals of polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120216)