Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.2.127
URN: urn:nbn:de:0030-drops-40191
URL: https://drops.dagstuhl.de/opus/volltexte/2013/4019/
Beasley, LeRoy B. ; Klauck, Hartmut ; Lee, Troy ; Theis, Dirk Oliver
Weitere Beteiligte (Hrsg. etc.): LeRoy B. Beasley and Hartmut Klauck and Troy Lee and Dirk Oliver Theis
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)
| pdf-format: |
|
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".
BibTeX - Entry
@Article{beasley_et_al:DR:2013:4019,
author = {LeRoy B. Beasley and Hartmut Klauck and Troy Lee and Dirk Oliver Theis},
title = {{Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)}},
pages = {127--143},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {3},
number = {2},
editor = {LeRoy B. Beasley and Hartmut Klauck and Troy Lee and Dirk Oliver Theis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/4019},
URN = {urn:nbn:de:0030-drops-40191},
doi = {10.4230/DagRep.3.2.127},
annote = {Keywords: nonnegative rank, combinatorial optimization, communication complexity, extended formulation size}
}
| Keywords: | nonnegative rank, combinatorial optimization, communication complexity, extended formulation size | |
| Seminar: | Dagstuhl Reports, Volume 3, Issue 2 | |
| Issue date: | 2013 | |
| Date of publication: | 20.06.2013 |
