理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- Kawamata Yujiro
- Kawamata Yujiro (1952—)
- Kawamoto Kihachiro
- Kawanabe Kyōsai
- Kawarasaki Chōjūrō
- Kawasaki
- Kawasaki disease in children
- Kawasaki theorem
- Kawatake Mokuami
- Kawatake Shigetoshi
- Kawauchi Rinko
- Kawiskan Kozbayev
- kaxi
- Kaya
- Kayah
- Kayahs
- kayak and canoeing place
- kayakeum
- kayakeum playing and singing
- kayaking
- Kayama Matazō
- Kaye-Bernstein-Kearsley-Zapas model
- Kayes
- Kayhan
- Kayin