理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- geometric shape
- geometric short-range order
- geometric short-range order, GSRO
- geometric significance
- geometric simplex
- geometric simplicial complex
- geometric simulation
- geometric solid
- geometric space
- geometric span
- geometric spline
- geometric spreading
- geometric spreading compensation
- geometric standard deviation
- geometric statics
- geometric structure
- Geometric structure of centrifugal impeller
- Geometric style
- geometric subobject
- geometric sum
- geometric surface area
- geometric texture
- geometric theorem
- geometric theory
- geometric theory of linear systems