arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.07779cs.CCcs.DM
收藏

非负秩与二进制秩

Nonnegative Rank vs. Binary Rank

Thomas Watson

摘要:

出于(并使用工具)通信复杂性,我们研究了以下两个等级的$0$矩阵之间的关系:它的非负秩和它的二进制秩(后者的$\log$是明确的非确定性通信复杂性)。证明了部分$0$ - $1$矩阵的指数分离性。对于总$0$ - $1$矩阵,我们表明,如果非负秩是最多$3$,那么这两个秩是相等的,我们展示了一个分离,展示了一个矩阵与非负秩$4$和二进制秩$5$,以及一个家庭的矩阵的二进制秩是$4/3$倍的非负秩。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑