理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- Hebei Hengshuihu Guojiaji Ziran Baohuqu
- Hebei Huanghua Gubeikedi Shengji Ziran Baohuqu
- Hebei Huangyangtan Shengji Ziran Baohuqu
- Hebei Jinhuashan-Henglingzi Hemaji Shengji Ziran Baohuqu
- Hebei Laoting Putidao Zhudao Shengji Ziran Baohuqu
- Hebei Liaoheyuan Shengji Ziran Baohuqu
- Hebei Liujiang Pendi Dizhiyiji Guojiaji Ziran Baohuqu
- Hebei Liuliping Mihou Shengji Ziran Baohuqu
- Hebei Lu
- Hebei Luanhe Shangyou Guojiaji Ziran Baohuqu
- Hebei Luanheyuan Shengji Ziran Baohuqu
- Hebei Mancheng Han Tomb protection project
- Hebei Manshan Shengji Ziran Baohuqu
- Hebei Maojingba Guojiaji Ziran Baohuqu
- Hebei Motianling Shengji Ziran Baohuqu
- Hebei Museum
- Hebei Nandagang Shidiheniaolei Shengji Ziran Baohuqu
- Hebei Nansizhang Shengji Ziran Baohuqu
- Hebei Nihewan Guojiaji Ziran Baohuqu
- Hebei People's Radio
- Hebei provincial archives
- Hebei Provincial Library
- Hebei Publishing & Media Group Co., Ltd.
- Hebei Qianheshan Shengji Ziran Baohuqu
- Hebei Qinglong Dushan Shengji Ziran Baohuqu