A semidefinite programming characterization of the Crawford number

We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within $\epsilon$ precision is computable in polynomial time in the data and $\mathrm{\mid }\log \epsilon \mathrm{\mid }$.