首页|Communication complexity of pointer chasing via the fixed-set lemma

Communication complexity of pointer chasing via the fixed-set lemma

来源：

Arxiv

英文摘要

I give a very simple, apparently new proof of a tight communication lower bound for pointer chasing.

作者：Emanuele Viola

作者单位：

学科分类：通信计算技术、计算机技术

推荐引用：Emanuele Viola.Communication complexity of pointer chasing via the fixed-set lemma[EB/OL].(2025-07-11)[2025-08-02].https://arxiv.org/abs/2507.08919.点此复制

Communication complexity of pointer chasing via the fixed-set lemma

Communication complexity of pointer chasing via the fixed-set lemma

评论