理学 计算复杂性 释 computational complexity 计算复杂性 研究一个计算问题所需要的计算资源的数量。计算资源有很多，其中最常用的是时间与空间，分别对应于时间复杂性和空间复杂性。两者的基本定义思路是一致的，本条目中以最常用的时间复杂度为例，也就是研究一个计算问题所需的运行时间。
＞组合数学、组合设计与图论＞图论＞释义 computational complexity 计算复杂性 computational complexity 计算复杂性†
理论计算机科学 可计算性与计算复杂性 释文 computational complexity 计算复杂性
- Summer Triangles
- Summer’s Last Will and Testament
- summing
- summing operator
- summit
- Summit Conference between the Five Countries of Central Asia in 1993
- summit diplomacy
- summit-metabolism
- Summit of the Heads of the Central American States
- Summit of the Presidents of the Central American States
- Summit of Turkic-Speaking Countries
- Summit on Information Construction of American Association of Information Science and Technology
- sum mod m
- summon
- Sumner crater
- Sumner line
- sumo
- sum of all coefficients equal to 1
- sum of a progression
- sum of a series
- sum of cardinal numbers
- sum of deviations squares
- sum of divisors
- sum of energy production
- sum of events