Is it in NP to check if the convex hull contains the unit ball? Given a set of $n$ points in $d$ dimensional Euclidean space, the problem is to determine if the convex hull contains the unit ball centered at the origin. 


  Is this problem in NP?


It is in co-NP as one can give a point in the ball outside the convex hull as a witness and verify this fact using linear programming.  

My focus here is not in computer precision relating to square roots although this may also be interesting.

(Related to https://mathoverflow.net/questions/141782/efficiently-determine-if-convex-hull-contains-the-unit-ball .)
The problem is NP-hard; see my answer at mathoverflow. Thus there is no polynomial-size certificate that the unit ball is contained in the convex hull of given points unless $\text{NP} = \text{co-NP}$ (if $\text{NP} = \text{co-NP}$ then the polynomial hierarchy collapses).