arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.03575cs.DScs.CCcs.CGcs.ITmath.IT
收藏

动态布尔数据结构下限的对数障碍跨越

Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds

Kasper Green Larsen, Omri Weinstein, Huacheng Yu

摘要:

本文证明了动态布尔函数(又称动态布尔函数)的单元探测复杂度的第一个超对数下界。decision)数据结构问题,这是数据结构下限的一个长期里程碑。我们介绍了一种新的方法来证明动态细胞探测下界,并使用它来证明一个$\tildeΩ(\log^{1.5} n)$下界的操作时间的范围广泛的布尔数据结构的问题,最值得注意的是,在$\mathbb{F}_2$的动态范围计数的查询时间([Pat07])。证明这个问题的$ω(\lg n)$下界被明确提出作为五个重要的开放问题之一,在已故的米哈伊·普雷特拉库的讣告[Tho 13]。这一结果也意味着第一$ω(\lg n)$下界的经典二维范围计数问题,在计算几何和空间数据库中最基本的数据结构问题之一。我们推导出类似的动态多项式评价和二维矩形刺伤的布尔版本的下界,并为(非布尔)的范围选择和范围中位数的问题。我们的技术核心是一种“弱”模拟动态数据结构的新方法,它使用高效的单向通信协议,与随机猜测相比具有很小的优势。该模拟涉及到一个令人惊讶的偏移到低次(切比雪夫)多项式,这可能是独立的利益,并提供了一个全新的算法角度Panigrahy等人的“细胞采样”方法。[PTW10]。

英文摘要:

This paper proves the first super-logarithmic lower bounds on the cell probe complexity of dynamic boolean (a.k.a. decision) data structure problems, a long-standing milestone in data structure lower bounds. We introduce a new method for proving dynamic cell probe lower bounds and use it to prove a $\tildeΩ(\log^{1.5} n)$ lower bound on the operational time of a wide range of boolean data structure problems, most notably, on the query time of dynamic range counting over $\mathbb{F}_2$ ([Pat07]). Proving an $ω(\lg n)$ lower bound for this problem was explicitly posed as one of five important open problems in the late Mihai Pǎtraşcu's obituary [Tho13]. This result also implies the first $ω(\lg n)$ lower bound for the classical 2D range counting problem, one of the most fundamental data structure problems in computational geometry and spatial databases. We derive similar lower bounds for boolean versions of dynamic polynomial evaluation and 2D rectangle stabbing, and for the (non-boolean) problems of range selection and range median. Our technical centerpiece is a new way of "weakly" simulating dynamic data structures using efficient one-way communication protocols with small advantage over random guessing. This simulation involves a surprising excursion to low-degree (Chebychev) polynomials which may be of independent interest, and offers an entirely new algorithmic angle on the "cell sampling" method of Panigrahy et al. [PTW10].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑