Pages that link to "Item:Q2871188"

The following pages link to Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188):

Displaying 7 items.

• Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
• On the intrinsic complexity of point finding in real singular hypersurfaces (Q990944) (← links)
• Efficient computation of dual space and directional multiplicity of an isolated point (Q1634816) (← links)
• Bit complexity for computing one point in each connected component of a smooth real algebraic set (Q2100045) (← links)
• Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
• Computing real witness points of positive dimensional polynomial systems (Q2357373) (← links)
• Explicit estimates for polynomial systems defining irreducible smooth complete intersections (Q5376581) (← links)