Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
复制标题
通信复杂性、线性优化和矩阵非负秩的下界
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Theis
中科院分区：
文献类型：
--
作者：
LeRoy Beasely;Troy Lee;H. Klauck;Dirk Oliver;Theis
本报告记录了Dagstuhl研讨会的计划和结果13082“沟通复杂性，线性优化和非负等级的下限”于2013年2月在Dagstuhl Castle举行。
This report documents the program and the outcomes of Dagstuhl Seminar 13082 “Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices”, held in February 2013 at Dagstuhl Castle.