理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- bidirectional edge
- bi-directional insulated gate bipolar transistor
- bidirectional path tracing
- bidirectional printing
- bidirectional pulse
- bidirectional reasoning
- bi-directional reflectance distribution function calibration
- bidirectional reflectance distribution function model，BRDF model
- bidirectional reflection distribution function
- bidirectional reflection distribution function, BRDF
- bidirectional replication
- bidirectional search
- bidirectional subsurface scattering reflection distribution function
- bidirectional subsurface scattering reflection distribution function, BSSRDF
- bidirectional tanslocation
- bidirectional texture function
- bi-directional thyristor
- bidirectional timing
- bidirectional Turing machine
- bidisc
- bi disease
- Bidong Sect of Taoism
- bid opening
- bid price
- bid rent curve