理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- Billet half lens
- billet shaping with electromagnetic force
- Billet split lens
- billi
- billiard ball collision
- billiard-ball collision
- billiard ball model
- billiard ball problem
- billiard court
- billiards
- billiard-table problem
- Billie Holiday
- Billingsley
- billion
- Billion Dollar Gift
- billitonite
- Bill Kong
- Bill Moggridge
- bill of chemical materials and material management
- bill of lading
- bill of material
- bill of material, BOM
- bill of materials
- bill of quantity
- Bill of Rights