搜索结果: 1-1 共查到“可计算性理论 communication”相关记录1条 . 查询时间(0.275 秒)
Overlays and Limited Memory Communication.
Communication Complexity Space Polynomial Hierarchy Combinatorial Characterization
font style='font-size:12px;'>
2016/1/22
We give new characterizations and lower bounds relating classes in the communication complexity polynomial hierarchy and circuit complexity to limited memory commu-nication models.