理学 计算复杂性 释 computational complexity 计算复杂性 研究一个计算问题所需要的计算资源的数量。计算资源有很多，其中最常用的是时间与空间，分别对应于时间复杂性和空间复杂性。两者的基本定义思路是一致的，本条目中以最常用的时间复杂度为例，也就是研究一个计算问题所需的运行时间。
＞组合数学、组合设计与图论＞图论＞释义 computational complexity 计算复杂性 computational complexity 计算复杂性†
理论计算机科学 可计算性与计算复杂性 释文 computational complexity 计算复杂性
- solvability set
- solvable
- solvable algebra
- solvable algebraic group
- solvable algorithmic problem
- solvable analytic group
- solvable by a Turing machine
- solvable by radicals
- solvable congruence
- solvable equation
- solvable extension
- solvable flow
- solvable group
- solvable group; soluble group
- solvable group variety
- solvable ideal
- solvable Lie algebra
- solvable Lie group
- solvable manifold
- solvable model
- solvable operator
- solvable problem
- solvable radical
- solvable ring
- solvable set