  We give a semidefinite programming characterization of the Crawford number.
We show that the computation of the Crawford number within $\varepsilon$
precision is computable in polynomial time in the data and $|\log \varepsilon
|$.
