Communication complexity of pointer chasing via the fixed-set lemma
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866918138592886784 |
|---|---|
| author | Viola, Emanuele |
| author_facet | Viola, Emanuele |
| contents | I give a simple proof of a tight communication lower bound for pointer chasing. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_08919 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Communication complexity of pointer chasing via the fixed-set lemma Viola, Emanuele Computational Complexity I give a simple proof of a tight communication lower bound for pointer chasing. |
| title | Communication complexity of pointer chasing via the fixed-set lemma |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2507.08919 |