Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth

Theoretical Computer Science（2020）

引用 3|浏览10

暂无评分

摘要

•A lower-bound size and-depth trade-off for DeMorgan circuits for semi-disjoint bilinear forms.•Any DeMorgan circuit of ≤ϵlog⁡n and-depth for the n-dim. Boolean vector convolution has Ω(n2−4ϵ) size.•Upper-bound trade-offs of similar form for Boolean vector convolution and matrix product.

查看译文

关键词

Boolean circuits,Boolean circuit complexity,Semi-disjoint bilinear form,Boolean vector convolution,Boolean matrix product

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要