理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- tetraconazole
- tetracontagon
- tetracrepid
- tetractine
- tetracuspid
- tetracyclic coordinate
- tetracyclic diterpene
- tetracyclic plane
- tetracycline
- tetracycline antibiotic
- tetracycline-antibiotic
- tetracycline fluorescence
- tetracyclines
- tetrad
- tetradecagon
- tetradecahedron
- tetradecanoic acid
- tetradentate ligand
- tetrad formalism
- tetradic
- tetradynamous stamen
- tetraene
- tetra ethoxy silane
- tetraethyl lead
- tetraethyl orthosilicate