On the intrinsic complexity of point finding in real singular hypersurfaces

In previous work we designed an efficient procedure that finds an algebraic sample point for each connected component of a smooth real complete intersection variety. This procedure exploits geometric properties of generic polar varieties and its complexity is intrinsic with respect to the problem. In the present paper we introduce a natural construction that allows to tackle the case of a non–smooth real hypersurface by means of a reduction to a smooth complete intersection