理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- circular helix
- circular hole diffraction
- circular iner-polation
- circular interpolation
- circularity
- circularizer
- circular jig
- circular knitting machine
- circular ladder graph
- circular linked list
- circular locus punching
- circular loom
- circular lune
- circularly polarized light
- circularly-polarized wave
- circularly polarized waves
- circular measure
- circular motion
- Circular Mound Altar
- circular muscle
- circular neighborhood
- circular orbit
- circular orbital radiation
- circular partial sum
- circular parts