{
  "id": "1305.4147",
  "version": "v1",
  "published": "2013-05-17T18:23:35.000Z",
  "updated": "2013-05-17T18:23:35.000Z",
  "title": "Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices",
  "authors": [
    "LeRoy Beasely",
    "Troy Lee",
    "Hartmut Klauck",
    "Dirk Oliver Theis"
  ],
  "categories": [
    "math.CO",
    "cs.CC",
    "cs.DM",
    "math.OC"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-05-17T18:23:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "lower bounds",
      "communication complexity",
      "linear optimization",
      "nonnegative rank",
      "dagstuhl report"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1305.4147B"
    }
  }
}