arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.01749cs.DScs.DM
收藏

在次线性时间中寻找单调模式

Finding monotone patterns in sublinear time

Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten

摘要:

本文从次线性算法的角度研究了求数组中单调连续性的问题。对于固定的$k \in \mathbb{N}$和$\varepsilon > 0$,我们发现,非自适应查询的复杂性,找到一个长度$k$单调子序列的$f \colon [n] \to \mathbb{R}$,假设$f$是$\varepsilon$ -远离免费的,这样的约束,是$Θ((\log n)^{\lfloor \log_2 k \rfloor})$。在我们的工作之前,由于Newman,Rabinovich,Rajendraprasad和Sohler(2017),这个问题的最佳算法使$(\log n)^{O(k^2)}$非自适应查询;以及$k = 2$情况下$Ω(\log n)$查询的唯一已知下限,其次是Ergün,Kannan,Kumar,Rubinfeld和Viswanathan(2000)和Fischer(2004)的单调性测试。

英文摘要:

We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$ monotone subsequence of $f \colon [n] \to \mathbb{R}$, assuming that $f$ is $\varepsilon$-far from free of such subsequences, is $Θ((\log n)^{\lfloor \log_2 k \rfloor})$. Prior to our work, the best algorithm for this problem, due to Newman, Rabinovich, Rajendraprasad, and Sohler (2017), made $(\log n)^{O(k^2)}$ non-adaptive queries; and the only lower bound known, of $Ω(\log n)$ queries for the case $k = 2$, followed from that on testing monotonicity due to Ergün, Kannan, Kumar, Rubinfeld, and Viswanathan (2000) and Fischer (2004).

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

↑