arXiv Analytics

Sign in

arXiv:1305.4147 [math.CO]AbstractReferencesReviewsResources

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

Published 2013-05-17Version 1

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.

Categories: math.CO, cs.CC, cs.DM, math.OC
Related articles: Most relevant | Search more
arXiv:1211.3248 [math.CO] (Published 2012-11-14, updated 2013-05-05)
Lower bounds on maximal determinants of +-1 matrices via the probabilistic method
arXiv:1404.7259 [math.CO] (Published 2014-04-29, updated 2015-10-09)
Lower bounds for on-line graph colorings
arXiv:1007.3546 [math.CO] (Published 2010-07-21, updated 2010-07-24)
Lower bounds for designs in symmetric spaces

Links

Toolbox