理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- bubbler
- bubble scalar integral
- bubble sextant
- Bubble Society
- bubble sort
- bubble sSort
- bubble tube
- bubble vial
- bubbling bed
- bubbling bed boiler
- bubbling breakdown
- bubbling fluidized bed gasifier
- bubbling pipette
- bubbling reactor
- Bubi
- Bubnoff, Serge von
- Bubnov
- Bubnov-Galerkin method
- Bubo
- Bucareli Conference
- buccal absorption
- buccal adhesive tablets
- buccal tablets
- Buchanan
- Bucharest