理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- Chocos
- Chocotaws
- Choe Inhun
- Cho Hunhyun
- Choibalsan
- Choi Bu
- choice
- choice and creation of healthy environment
- choice and creation of healthy residency
- choice axiom
- choice function
- choice number
- choice of a base
- choice of the moment of time
- choice principle
- choice problem
- choice sequence
- choice set
- Choi Cheong-hee
- Choi Chi-won
- Choi Chung
- Choie Sew Hoy
- Choi Guang-yu
- Choi Inho
- Choi Inhun