Pages that link to "Item:Q5120216"

The following pages link to On the Complexity of Computing Real Radicals of Polynomial Systems (Q5120216):

Displaying 16 items.

• On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
• On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
• Computation of generalized real radicals of polynomial ideals (Q1297627) (← links)
• Complexity of finding irreducible components of a semialgebraic set (Q1346599) (← links)
• Computation of real radicals of polynomial ideals. II (Q1380019) (← links)
• Global optimization of polynomials over real algebraic sets (Q1730308) (← links)
• On the bit complexity of polynomial system solving (Q1734694) (← links)
• Smooth points on semi-algebraic sets (Q2100053) (← links)
• An improvement of the rational representation for high-dimensional systems (Q2121180) (← links)
• Computing real radicals and \(S\)-radicals of polynomial systems (Q2200311) (← links)
• Probabilistic algorithm for computing the dimension of real algebraic sets (Q2819735) (← links)
• Complexity Analysis of Root Clustering for a Complex Polynomial (Q2985810) (← links)
• (Q3135197) (← links)
• Computing the real isolated points of an algebraic hypersurface (Q5145987) (← links)
• Tensor Manifold with Tucker Rank Constraints (Q5865922) (← links)
• On the effective Putinar's Positivstellensatz and moment approximation (Q6044976) (← links)