计算的复杂性理论研究算法的时间复杂性和空间复杂性。
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 - o notation：计算复杂性理论使用大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.
应用推荐