Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
arXiv:1305.4147
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.
References in corpus (6)
- Clique versus Independent Set
- On the existence of 0/1 polytopes with high semidefinite extension complexity
- Some 0/1 polytopes need exponential size extended formulations
- Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix
- Fooling-sets and rank in nonzero characteristic (extended abstract)
- An upper bound for nonnegative rank