跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.11508 · v1

Amortized Cell-Probe Lower Bounds for Dynamic Boolean Problems

首次提交 2026-11-09 01:29
版本更新 2026-11-09 01:29
雷达观测 2026-11-10 13:19
arXiv ↗PDF ↗

摘要

We prove the first unconditional amortized Ω((log⁡N/log⁡log⁡N)2)Ω\big((\log N/\log\log N)^2\big) cell-probe lower bound for a Boolean dynamic problem. For insert-only multiphase Disjointness with NN query sets over [N][N] and word size w=Θ(log⁡N)w=Θ(\log N), a fixed distribution of interleaved insertions and queries forces this expected average cost per operation, excluding preprocessing. The bound allows sufficiently small constant error for each query of every fixed legal sequence and imposes no restriction on individual operation costs. It transfers to incremental directed reachability, incremental subgraph connectivity, and fully dynamic triangle detection. We also prove tq=Ω((log⁡N/log⁡(tuw))2)t_q=Ω\big((\log N/\log(t_uw))^2\big) for amortized insertion time 1≤tu=No(1)1\le t_u=N^{o(1)} and expected query time tqt_q, when the number of insertions before the final query is not announced in advance. We reach the quadratic-logarithmic scale with bounded error by combining interleaving with the 2.5-round communication framework [Ko26a, Ko26b] and controlling errors among accepted simulations.

作者备注:20 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-09 01:29 · 最新观测版本

Amortized Cell-Probe Lower Bounds for Dynamic Boolean Problems

We prove the first unconditional amortized Ω((log⁡N/log⁡log⁡N)2)Ω\big((\log N/\log\log N)^2\big) cell-probe lower bound for a Boolean dynamic problem. For insert-only multiphase Disjointness with NN query sets over [N][N] and word size w=Θ(log⁡N)w=Θ(\log N), a fixed distribution of interleaved insertions and queries forces this expected average cost per operation, excluding preprocessing. The bound allows sufficiently small constant error for each query of every fixed legal sequence and imposes no restriction on individual operation costs. It transfers to incremental directed reachability, incremental subgraph connectivity, and fully dynamic triangle detection. We also prove tq=Ω((log⁡N/log⁡(tuw))2)t_q=Ω\big((\log N/\log(t_uw))^2\big) for amortized insertion time 1≤tu=No(1)1\le t_u=N^{o(1)} and expected query time tqt_q, when the number of insertions before the final query is not announced in advance. We reach the quadratic-logarithmic scale with bounded error by combining interleaving with the 2.5-round communication framework [Ko26a, Ko26b] and controlling errors among accepted simulations.

查看此版本解读 →查看此版本原文 ↗