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.
由於這些算法對內存的過度需求，導致我們無法在郃理的時間內求解大數據量問題。