理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- product of subgroups
- product of tensors
- product of transformations
- product of translation
- product of vectors
- product of σ-rings
- product operation
- product order
- product orientation
- product path
- product phase
- product photography
- product placement
- Product portfolio strategy
- Product Positioning
- product-preserving functor
- product-principle layout
- product process matrix
- product projection
- product quality audit
- product quality certification
- product quality certification system
- product quality guaranty insurance
- product quality law
- Product Quality Law of the People's Republic of China