网络释义专业释义英英释义
用计算复杂度理论(Computational complexity theory) 来说，它平均需要 O(n2) 次运算。快速排序 (Quicksort) 是霍尔想到的第二个算法。
基于52个网页-相关网页
短语
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.
这包括可计算性理论，计算复杂性理论，信息理论。
-
It absorbed some results of artificial intelligence, probability and statistics, computational complexity theory, control theory, information theory, philosophy, physiology, neurobiological.
它吸取了人工智能、概率统计、计算复杂性理论、控制论、信息论、哲学、生理学、神经生物学等学科的成果。
应用推荐
$firstVoiceSent
- 来自原声例句