理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- pair amplitude
- pair annihilation
- pair annihilation cross-section
- pair annihilation neutrino process
- Pairav Sulaimoni
- pair bottom trawling
- pair-breaking effect
- pair conversion
- pair correlation conjecture
- pair coupling
- pair creation
- pair creation, pair production
- pair crossed mill
- pair current
- pair distribution function
- pair-distribution function
- paired
- paired assistance
- paired carried multiple access，PCMA
- paired comparison
- paired comparison model
- paired data
- paired design
- paired designed trial
- paired difference test