worst-case complexity

基本解释

Reasoners for OWL DL, while dealing with a decidable sublanguage, will be subject to higher worst-case complexity.
而OWL DL的推理机处理的尽管是一个可判定的子语言，会有更高的最坏情况复杂度。
The most attractive property of GS-SVMs is that its computational complexity in the worst case only scales quadratically with the size of training samples.
贪婪分阶段支持向量机最吸引人的优点是在最差情况下，它的计算复杂度仅是训练样本数的平方。
The worst-case complexity estimate reveals that the direct applications of these algorithms are not computationally feasible for large-scale instances due to excessive memory requirements.
由于这些算法对内存的过度需求，导致我们无法在合理的时间内求解大数据量问题。