理学 计算复杂性 释 proof complexity 证明复杂性 证明复杂性（proof complexity）是计算复杂性的研究方向之一，它关注的是逻辑系统中命题的最短证明的长度。
理论计算机科学 可计算性与计算复杂性 释文 proof complexity 证明复杂性
- David Rousset
- David Roxbee Cox
- David Rubadiri
- David Russell
- David Russell Lange
- David Samuilovich Samoilov
- David Sarnoff
- David Schad Ward
- David Seymour
- David Shahar
- David Smith
- David's myotis
- Davidson Black
- Davidsonian Event Semantics
- David Sonnenschein
- David Stefansson
- David Stern
- David Storey
- David Tabor
- David Turnbull
- David Vogel
- David Wiggins
- David Williamson
- David Wineland
- Davies