理学 计算复杂性 释 communication complexity 通讯复杂性 计算复杂性的研究方向之一。其只考虑多方（通常是两方）合作计算过程中通信的开销，而忽略各方本地计算的开销。作为一个基础模型，它在很多领域的各种下界（lower bound）证明中起着重要作用。
理论计算机科学 可计算性与计算复杂性 释文 communication complexity 通信复杂性
- route vertical control survey
- Routh
- Routh equation
- Routh-Hurwitz criterion
- Routh-Hurwitz stability criterion
- Routh-Hurwitz theorem
- Routh limit
- Routh method of reduction
- Routh theorem
- Routh–Hurwitz stability criterion
- routine
- routine activities theory
- routine analysis
- routine observation
- routine report
- routing
- routing algorithm
- routing design
- routing function
- Routing Hijacking
- routing information flooding
- routing information protocol
- routing information protocol, RIP
- routing in sensor networks
- routing loop