理学 复杂性类 释 complexity class 复杂性类 复杂性类是计算模型在资源约束下能够求解的问题类，计算模型有图灵机和电路等，资源有时间、空间、随机性、交互性、非确定性等。常见的复杂性类有时间复杂性类、空间复杂性类、概率复杂性类、量子复杂性类、电路复杂性类（见电路复杂性）、交互式证明系统（见交互式证明）等。复杂性类可以是判定问题类，也可以是函数类。
＞数论＞算法数论＞释义 complexity class 复杂性类 complexity class 复杂性类
理论计算机科学 可计算性与计算复杂性 释文 complexity class 复杂性类
- Whose Justice? Which Rationality?
- Who Sleeps My Bro
- WHP
- Wh-question
- WH Smith PLC
- WHT
- W. Hurewicz
- W. Hurewicz (1904—1956)
- W. H. Wollaston
- W. H. Wollaston, 1766—1828
- Whyalla
- Whyburn
- Why Is a Crow Black?
- Why is That Red Political Power can Exist in China?
- Why Not Her
- Why We Fight
- WH史密斯连锁集团
- WI
- WIAD
- Wichita
- Wick
- Wick chronological operator
- Wick constant
- Wick exponential
- Wick formula