• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Some Order Dimension Bounds for Communication Complexity Problems (February 1991)
【24h】

Some Order Dimension Bounds for Communication Complexity Problems (February 1991)

机译：通信复杂性问题的一些订单维度界限（1991年2月）

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The authors associate with a general (0,1)-matrix M, an ordered set P(M), and derive lower and upper bounds for the deterministic communication complexity of M in terms of the order dimension of P(M). They furthermore consider the special class of communication matrices M obtained as cliques vs. stable sets incidence matrices of comparability graphs G. Their complexity is bound by O((log d)-(log n)), where n is the number of nodes of G and d is the order dimension of an orientation of G. In this special case, the authors bound is shown to improve other well-known bounds obtained for the general cliques vs. stable set problem.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号