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

数据流计算复杂性的代数方法

An algebraic approach to complexity of data stream computations

Sumit Ganguly

摘要:

我们考虑一般数据流模型中的基本问题,即,估计任意更新的向量$f \in \Z^n$(即,递增或递减)坐标方式。估计$\hat{f} \in \Z^n$必须满足$\norm{\hat{f}-f}_{\infty}\le ε\norm{f}_1 $,即$\forall i ~(\abs{\hat{f}_i - f_i} \le ε\norm{f}_1)$。已知具有$\tilde{O}(ε^{-1})$随机化空间上界\cite{cm:jalgo}、$Ω(ε^{-1} \log (εn))$空间下界\cite{bkmt:sirocco03}和$\tildeΩ(ε^{-2})$比特的确定性空间上界。\footnote{The $\tilde{O}$ and $\tildeΩ$ notations suppress poly-logarithmic factors in $n, \log ε^{-1}, \norm{f}_{\infty}$ and $\log δ^{-1}$, where, $δ$ is the error probability (for randomized algorithm).}我们表明,这个问题的任何确定性算法需要空间$Ω(ε^{-2} (\log \norm{f}_1))$位。

英文摘要:

We consider a basic problem in the general data streaming model, namely, to estimate a vector $f \in \Z^n$ that is arbitrarily updated (i.e., incremented or decremented) coordinate-wise. The estimate $\hat{f} \in \Z^n$ must satisfy $\norm{\hat{f}-f}_{\infty}\le ε\norm{f}_1 $, that is, $\forall i ~(\abs{\hat{f}_i - f_i} \le ε\norm{f}_1)$. It is known to have $\tilde{O}(ε^{-1})$ randomized space upper bound \cite{cm:jalgo}, $Ω(ε^{-1} \log (εn))$ space lower bound \cite{bkmt:sirocco03} and deterministic space upper bound of $\tildeΩ(ε^{-2})$ bits.\footnote{The $\tilde{O}$ and $\tildeΩ$ notations suppress poly-logarithmic factors in $n, \log ε^{-1}, \norm{f}_{\infty}$ and $\log δ^{-1}$, where, $δ$ is the error probability (for randomized algorithm).} We show that any deterministic algorithm for this problem requires space $Ω(ε^{-2} (\log \norm{f}_1))$ bits.

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

↑