Worst-Case Complexity [计] 最坏情况复杂性 ; 最坏情况下的复杂度 ; 最坏情况复杂度
Case Complexity Type 案件难易类型
Worst-Case Time Complexity 时间复杂度
Best-Case Time Complexity 时间复杂度
Case Time Complexity 时间复杂度
best case time complexity 最好情况时间复杂度
worst-case iteration complexity 最坏情况下的迭代复杂性
Reasoners for OWL DL, while dealing with a decidable sublanguage, will be subject to higher worst-case complexity.
而OWL DL的推理机处理的尽管是一个可判定的子语言,会有更高的最坏情况复杂度。
This allegation has led to Google becoming mired in a legal battle whose scope and complexity makes the Jarndyce and Jarndyce case in Charles Dickens' Bleak House look straightforward.
这一指控使谷歌陷入了一场法律纠纷的泥潭,这场纠纷的范围和复杂性使得查尔斯•狄更斯的《荒凉山庄》中的贾尼斯和贾尼斯案看起来很简单。
In this case, the architect adds value by analyzing the impact and complexity of the requirements.
在这种情况下,架构师可通过分析需求的影响和复杂性增加价值。
What's the complexity of this decision tree solution? Well, in the worst case, we're enumerating every possibility of in and out.
决策树解决方法的复杂度是多少?,在最糟的例子中得列举,所有可能的输入和输出。
Right? If that was the case in that code, then my complexity is no longer log, because I need linear access for each time I've got to go to the list, and it's going to Lisp be much worse than that.
这里的复杂度不再是对数的了,因为每次在列表中,查找需要线性访问,可能还要糟糕,其实,有些编程语言,如。
In the linear case, meaning in the unsorted case what's the complexity of this? k times n, right? Order n to do the search, and I've got to do it k times, so this would be k times n.
复杂度是多少?k的n次方,对吧?,在序列n中做搜索,要做k次,所以是k的n次方次,如果先排序后搜索。
应用推荐