Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices

2013/05/17 by LeRoy Beasely, Beasely, LeRoy, Troy Lee +5
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #cs.CC #cs.DM #math.CO #math.OC

paper · pdf · doi:10.48550/arxiv.1305.4147

arxiv created 2013/05/17 · arxiv updated 2013/05/20

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.

Related

• Structure in Communication Complexity and Constant-Cost Complexity Classes
• 07071 Report on Dagstuhl Seminar – Web Information Retrieval and Linear Algebra Algorithms
• A direct proof for Lovett's bound on the communication complexity of low rank matrices
• An upper bound for nonnegative rank
• New lower bounds for the rank of matrix multiplication