专业释义英英释义
Computational complexity theory
- 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.
这包括可计算性理论，计算复杂性理论，信息理论。
-
For curricula automata subject a more advanced graduate course, computability theory and computational complexity theory are also covered.
高级课程中还包括了可计算包括理论模型理论和计算复杂性理论。
-
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符号描述输入数据大小如何影响计算资源对算法的使用。
应用推荐