理学 计算复杂性 释 counting complexity 计数复杂性 计数复杂性指计数问题的算法易解性和计算困难性（见计算复杂性）。
理论计算机科学 可计算性与计算复杂性 释文 counting complexity 计数复杂性
- Boris Andreevich Mozhaev
- Boris Andreyev
- Boris Andreyevich Lavrenyov
- Boris Andreyevich Pilnyak
- Boris Babochkin
- Boris Borisovich Golitsyin
- Boris borozanov
- Boris Chirkov
- Boris Christoff
- Boris Fedorovich Lomov
- Boris Gerasimovich Ananiev
- Boris Godunov
- Boris Grinchenko
- Boris Groys
- Boris Iakovlevitch Vladimirtsov
- Boris Ignatovitch
- Boris Ivanovich Orlovsky
- Boris Ivanovich Prorokov
- Boris Konstantinovich Zaitsev
- Borislav Sharaliev
- Boris Leonidovich Pasternak
- Boris Mikhailov
- Boris Mikhailovich Eikhenbaum
- Boris Mikhaylovich Kustodiev
- Boris Natanovich Strugatsky