Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

Dirk Oliver Theis; Hartmut Klauck; LeRoy Beasely; Troy Lee

arxiv: 1305.4147 · v1 · pith:ST2ME452new · submitted 2013-05-17 · 🧮 math.CO · cs.CC· cs.DM· math.OC

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

LeRoy Beasely , Troy Lee , Hartmut Klauck , Dirk Oliver Theis This is my paper

classification 🧮 math.CO cs.CCcs.DMmath.OC

keywords dagstuhlboundscommunicationcomplexitylinearlowermatricesnonnegative

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

discussion (0)