理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- transverse Zeeman effect-birefringence
- transverse Zeeman effect-polarization double reflection
- transverse Zeeman splitting
- transversion
- transversospinale muscle
- transversus thoracis muscle
- transverter
- transvestic disorder
- Transylvania lottery
- Trans–West African Coastal Highway
- Tran Tuc Luong
- trap
- TRAPATT
- TRAPATT=trapped plasma avalanche triggered transit diode
- Trap Barrier System
- trap circuit
- trap coefficient
- trapdoor
- trapdoor function
- trapdoor one-way function
- trapdoor one-way hash function
- trapdoor secret
- trap effect
- trap evaluation
- trapeze