理学 复杂性类 释 complexity class 复杂性类 复杂性类是计算模型在资源约束下能够求解的问题类，计算模型有图灵机和电路等，资源有时间、空间、随机性、交互性、非确定性等。常见的复杂性类有时间复杂性类、空间复杂性类、概率复杂性类、量子复杂性类、电路复杂性类（见电路复杂性）、交互式证明系统（见交互式证明）等。复杂性类可以是判定问题类，也可以是函数类。
＞数论＞算法数论＞释义 complexity class 复杂性类 complexity class 复杂性类
理论计算机科学 可计算性与计算复杂性 释文 complexity class 复杂性类
- approximation in the quadratic mean
- approximation method
- approximation of an equation
- approximation of an operator
- approximation of a solution
- approximation of effective medium
- approximation order
- approximation polynomial
- approximation problem
- approximation process
- approximation property
- approximation scheme
- approximation solvability
- approximation theorem
- approximation theory
- approximation theory of functions
- approximation to complex functions
- approximation with constraints
- approximation with interpolating constraints
- approximation with restricted range
- approximation with weight
- approximative
- approximative compactness
- approximative dimension
- approximative functional equation