COMPUTATIONAL COMPLEXITY 中文是什么意思

Computational complexity theory has developed rapidly in the past three decades.

计算复杂性理论在过去三十多年中发展迅速。

The set of primitiverecursive functions is known as PR in computational complexity theory.

原始递归函数的集合在计算复杂性理论中叫做PR。

Computational complexity is one thing, but human complexity is another.

计算复杂性是一件事，人类复杂性是另外一件事。

This further guarantees the computational complexity, credibility and verification speed.

这样就更进一步的保证了计算的复杂度、可信度和验证速度。

This was proved by Gabriel Lamé in 1844,and marks the beginning of computational complexity theory.

拉梅于1844年证明了这点，同时这也标志着计算复杂性理论的开端。

What's the computational complexity of finding a document's most frequently used words?

查找文档最常用的词的计算复杂性是什么？?

Hayek's argumentation is not only regarding computational complexity for the central planners, however.

然而，哈耶克的论点不仅注意到了中央计划者计算的复杂性。

The computational complexity of the following problems about default logic is known:.

关于缺省逻辑的下列问题的计算复杂性是已知的：.

This was proven by Gabriel Lamé in 1844,and marks the beginning of computational complexity theory.

数学家拉梅于1844年证明了这点，同时这也标志着计算复杂性理论的开端。

It addresses the issue of computational complexity and can also respond to changing parameters in real time.

它解决了计算复杂性的问题，并且还可以实时响应变化的参数。

The goal of this articleis primarily to discuss the relative speed/computational complexity of these methods.

本文的目标主要是讨论这些方法的相对速度/计算复杂性。

Computational complexity can legitimately claim to be one of the few truly predictive theories in all of computer“science.”.

计算复杂度是所有计算机“科学”中为数不多的真正的预测理论之一。

Moreover, the choice of the object detector can heavily influence computational complexity and final accuracy.

此外，目标检测器的选择会极大影响计算复杂度和最终准确率。

Computational complexity(worst, average and best behavior) in terms of the size of the list(n).

计算的时间复杂度（最差、平均、和最好性能），依据串列（list）的大小(n{\displaystylen})。

Moreover, the choice of the object detector can heavily influence computational complexity and final accuracy.

此外，对象探测器的选择，也会严重影响计算复杂度和最终准确率。

However, the computational complexity of this tracker is rather high, thereby limiting its applications in real-time scenarios.

然而，这个跟踪系统的计算复杂度相当高，因此限制了其在实时场景的应用。

Thus, adding base estimators beyond 10 only increases computational complexity without accuracy gains for the Iris dataset.

因此，添加超过10个基估计器只会增加计算复杂度，而不会提高鸢尾花数据集的准确度。

Computational complexity can legitimately claim to be one of the few truly predictive theories in all of computer“science.”.

计算复杂性可以合法地声称是所有计算机“科学”中为数不多的真正的预测理论之一。

Fortnow originated and has coauthored the Computational Complexity weblog since 2002, the first major theoretical computer science blog.

Fortnow教授创立了ComputationalComplexity博客，这是第一个主流计算机理论科学博客。

Computational complexity is the area of computer science that contemplates the reasons why some problems are so hard to solve by computers.

计算复杂性是计算机科学中思考为什么有些问题用计算机难以解决的领域。

Such as computer graphics, emphasize the computation of specific results, while others,such as computational complexity theory, study the properties of computational problems.

其中一些，比如计算机图形学强调特定结果的计算，而另外一些，比如计算复杂性理论是学习计算问题的性质。

One of the roles of computational complexity theory is to determine the practical limits on what computers can and cannot do.

计算复杂性理论的一个作用就是确定一个能或不能被计算机求解的问题的所具有的实际限制。

The research supported through the initiative will span areas from new materials science for quantum devices to quantum computer architecture,algorithm design and computational complexity.

这项计划支持的研究将跨越从量子器件的新材料科学到量子计算机体系结构、算法设计和计算复杂性等领域。

To circumvent this computational complexity and provide effective real-time path planning, probabilistic planners have been utilized.

为了规避这个计算复杂度并提供有效的实时路径规划，一般使用概率性规划器。

In computational complexity theory, the problem of determining the complexity of a computable function is known as a function problem.

在计算复杂性理论中，确定一个可计算函数的复杂性的问题叫做功能性问题。

His doctoral dissertation, focused on reducing the computational complexity associated with dexterous robotic grasping, was the winner of the 2010 Robotdalen Scientific Award.

他的博士论文是关于降低与机器人抓取相关的计算复杂性，并且获得2010年Robotdalen科学奖。

By this they raised the computational complexity of the networks of some cryptocurrencies to such values that solo-mining became practically impossible.

用这种方式，他们将某些加密货币网络的计算复杂性提高到了这样的值，即独奏采矿变得几乎不可能。

We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer.

我们扩展了在计算复杂度上的之前的结果，以证明该采样任务在经典计算机中必然需要指数量级的时间复杂度。

A related field of study, drawing from computational complexity theory, is game complexity, which is concerned with estimating the computational difficulty of finding optimal strategies.

借鉴相关领域的研究，计算复杂性理论，是游戏的复杂性，关注的是估计的计算难度找到最佳的战略。