【computational_complexity_theory】什么意思_英语computational_complexity_theory的翻译_音标_读音_用法_例句_在线翻译

computational complexity theory

计算复杂性理论

计算复杂性理论(computational complexity theory)：用数学方法研究各类问题的计算复杂性学科。

基于4875个网页-相关网页

计算复杂度理论

用计算复杂度理论(Computational complexity theory) 来说，它平均需要 O(n2) 次运算。快速排序 (Quicksort) 是霍尔想到的第二个算法。

基于52个网页-相关网页

空间复杂度

... 时间空间复杂度 time space complexity 空间复杂度 computational complexity theory; space complexity 时间复杂性 time complexity ...

基于1个网页-相关网页

短语

电子、通信与自动控制技术 | 计算机科学技术

·2,447,543篇论文数据，部分数据来源于NoteExpress

abstract: Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm.

以上来源于: WordNet

This includes computability theory, computational complexity theory, and information theory.

这包括可计算性理论，计算复杂性理论，信息理论。

youdao
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.

高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。

youdao
Big-O notation: computational complexity theory USES big-O notation to describe how input-data size affects an algorithm's use of computational resources.

Big - o notation：计算复杂性理论使用大0符号描述输入数据大小如何影响计算资源对算法的使用。

youdao

更多双语例句

应用推荐

$firstVoiceSent

- 来自原声例句