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 |$.

翻译：我们给出了Crawford数的半定规划刻画。我们证明了在$\varepsilon$精度内计算Crawford数可在关于数据和$|\log \varepsilon|$的多项式时间内完成。