计算的复杂性理论研究算法的时间复杂性和空间复杂性。
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
有三个核心领域：形式语言与自动机理论、可计算性理论和计算的复杂性理论。
The three main research areas of the theory are: formal language and automata theory, computability theory and the computing complexity theory.
Big - onotation：计算复杂性理论使用大0符号描述输入数据大小如何影响计算资源对算法的使用。
Big-O notation: computational complexity theory USES big-O notation to describe how input-data size affects an algorithm's use of computational resources.
下面的表格指出了在可计算性和复杂性理论应当考虑的一些种类的问题。
The following table shows some of the classes of problems that are considered in computability theory and complexity theory.
下面的表格指出了在可计算性(蓝色)和复杂性理论(绿色)应当考虑的一些种类的问题。
The following table shows some of the classes of problems (or languages, or grammars) that are considered in computability theory (blue) and complexity theory (green).
通讯复杂性理论是一个计算抽象模型，它关心的是系统内部之间的数据通讯量的大小。
Communication complexity theory is a abstract computational model, which deal with the number of communication between the inner of system.
它吸取了人工智能、概率统计、计算复杂性理论、控制论、信息论、哲学、生理学、神经生物学等学科的成果。
It absorbed some results of artificial intelligence, probability and statistics, computational complexity theory, control theory, information theory, philosophy, physiology, neurobiological.
它吸取了人工智能、概率统计、计算复杂性理论、控制论、信息论、哲学、生理学、神经生物学等学科的成果。
It absorbed some results of artificial intelligence, probability and statistics, computational complexity theory, control theory, information theory, philosophy, physiology, neurobiological.
应用推荐