Boolean circuits, tensor ranks and communication complexity.
We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. Our methods are combinatorial, but we think that...
| 发表在: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| 主要作者: | |
| 格式: | 文件 |
| 语言: | English |
| 主题: |