Motivated by (and using tools from) communication complexity, we investigate the relationship between the following two ranks of a 0-1 matrix: its nonnegative rank and its binary rank (the log of the latter being the unambiguous nondeterministic communication complexity). We prove that for partial 0-1 matrices, there can be an exponential separation. For total 0-1 matrices , we show that if the nonnegative rank is at most 3 then the two ranks are equal, and we show a separation by exhibiting a matrix with nonnegative rank 4 and binary rank 5, as well as a family of matrices for which the binary rank is 4/3 times the nonnegative rank.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.