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
TL;DR
This report summarizes discussions and outcomes from a seminar focused on communication complexity, linear optimization, and establishing lower bounds for the nonnegative rank of matrices, highlighting recent advances and open problems.
Contribution
The report consolidates recent research findings and identifies new directions in understanding the nonnegative rank and its implications for optimization and complexity theory.
Findings
New lower bounds for nonnegative rank established
Connections between communication complexity and matrix factorization clarified
Open problems and future research directions outlined
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Complexity and Algorithms in Graphs · Advanced Graph Theory Research