The Direct Sum of Universal Relations.

Information Processing Letters（2018）

引用 2|浏览47

暂无评分

摘要

•We consider the direct-sum question for the universal relation.•We show that solving m instances needs m⋅(n−O(log⁡m)) bits using an information-theoretic argument.•We describe a newer bound of m⋅(n−1)−1 due to Alexander Kozachinsky using a rank argument.

查看译文

关键词

Direct sum,Universal relation,Communication complexity,Karchmer–Wigderson relations,Computational complexity

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要