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

比特流计算的复杂性

The complexity of computation in bit streams

Raphael Clifford, Markus Jalsenius, Benjamin Sach

摘要:

我们重新审视在线计算的复杂性,在细胞探针模型。我们考虑一类问题,其中我们首先给出$n$符号的固定模式或向量$F$,然后一个符号在流中一次到达。在每个符号到达之后,我们必须输出$F$和到达流的$n$长度后缀的某个函数。$Ω(δ\lg{n}/w)$的单元探测边界先前已经针对该设置中的卷积和汉明距离两者示出,其中$δ$是以比特为单位的符号的大小,并且$w\inΩ(\lg{n})$是以比特为单位的单元大小。然而,当$δ$是一个常数,因为它是在许多自然的情况下,这些以前的结果不再给我们非平凡的界限。我们引入了一个新的片面的信息传输证明技术,使我们能够证明有意义的下限,即使是恒定大小的输入字母。我们使用我们的新框架来证明一个摊销的细胞探针下限的$Ω(\lg^2 n/(w\cdot \lg \lg n))$时间每个到达位的一个很好的研究称为模式匹配与地址错误的问题的在线版本。这是第一个非平凡的细胞探针下界的任何在线问题的比特流,仍然持有时,细胞大小很大。我们还显示了相同的限制在线卷积条件下的一个新的组合猜想相关的Toeplitz矩阵。

英文摘要:

We revisit the complexity of online computation in the cell probe model. We consider a class of problems where we are first given a fixed pattern or vector $F$ of $n$ symbols and then one symbol arrives at a time in a stream. After each symbol has arrived we must output some function of $F$ and the $n$-length suffix of the arriving stream. Cell probe bounds of $Ω(δ\lg{n}/w)$ have previously been shown for both convolution and Hamming distance in this setting, where $δ$ is the size of a symbol in bits and $w\inΩ(\lg{n})$ is the cell size in bits. However, when $δ$ is a constant, as it is in many natural situations, these previous results no longer give us non-trivial bounds. We introduce a new lop-sided information transfer proof technique which enables us to prove meaningful lower bounds even for constant size input alphabets. We use our new framework to prove an amortised cell probe lower bound of $Ω(\lg^2 n/(w\cdot \lg \lg n))$ time per arriving bit for an online version of a well studied problem known as pattern matching with address errors. This is the first non-trivial cell probe lower bound for any online problem on bit streams that still holds when the cell sizes are large. We also show the same bound for online convolution conditioned on a new combinatorial conjecture related to Toeplitz matrices.

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

↑