arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1412.6935cs.DScs.CC
收藏

流问题的时间界限

Time Bounds for Streaming Problems

Raphael Clifford, Markus Jalsenius, Benjamin Sach

摘要:

我们给出了严格的细胞探测边界的时间来计算卷积,乘法和汉明距离流。单元探测器模型是特别强的计算模型,并且包括例如流行的字RAM模型。我们首先考虑在线卷积,其中任务是输出固定$n$维向量与来自流的$n$最近值的向量之间的内积。流的一个符号每次到达,并且必须在下一个符号到达之前计算每个输出。接下来,我们展示在线乘法的边界,其中流由数字对组成,两个要相乘的$n$数字中的每一个数字。一对一次到达,任务是在下一对数字到达之前从产品中输出一个新的数字。最后,我们看一下在线汉明距离问题,其中输出汉明距离而不是内积。对于这三个问题中的每一个,我们给出了每个输出的平均$Ω(\fracδ{w}\log n)$时间的下限,其中$δ$是表示输入符号所需的位数,$w$是单元或字的大小。我们认为,这些约束实际上是紧内的细胞探针模型。

英文摘要:

We give tight cell-probe bounds for the time to compute convolution, multiplication and Hamming distance in a stream. The cell probe model is a particularly strong computational model and subsumes, for example, the popular word RAM model. We first consider online convolution where the task is to output the inner product between a fixed $n$-dimensional vector and a vector of the $n$ most recent values from a stream. One symbol of the stream arrives at a time and the each output must be computed before the next symbols arrives. Next we show bounds for online multiplication where the stream consists of pairs of digits, one from each of two $n$ digit numbers that are to be multiplied. One pair arrives at a time and the task is to output a single new digit from the product before the next pair of digits arrives. Finally we look at the online Hamming distance problem where the Hamming distance is outputted instead of the inner product. For each of these three problems, we give a lower bound of $Ω(\fracδ{w}\log n)$ time on average per output, where $δ$ is the number of bits needed to represent an input symbol and $w$ is the cell or word size. We argue that these bound are in fact tight within the cell probe model.

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

↑