arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0608085cs.CCcs.DMcs.ITmath.IT
收藏

无限制确定性决策分支规划的二次时空折衷

A Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs

Nandakishore Santhi, Alexander Vardy

摘要:

对于编码理论中的一个决策问题,证明了$q$路确定性决策分支程序的二次期望时空折衷形式为$\eT\eS=Ω(\tfrac{n^2}{q})$,其中$q\geq 2$ .这里,当所有输入都是相等的可能性时,$\eT$是预期的计算时间,$\eS$是预期的空间。据我们所知,这个界限是第一个这样显示指数大小的要求,无论何时$\eT = O(n^2)$。以前的布尔决策分支程序的指数大小权衡是有效的时间限制模型与$T=o(n\log_2{n})$。证明无限制时间决策分支程序的二次时空权衡一直是最近研究的一个主要目标-这个目标已经在二十年前实现了多输出分支程序。我们还展示了布尔决策分支程序验证循环卷积,矩阵向量乘法和离散傅立叶变换的第一个二次时空权衡。此外,我们证明了一个建设性的布尔决策函数,具有二次预期的时间-空间权衡的布尔确定性决策分支程序模型。当$q$是一个常数的权衡结果得出这里的决策功能验证各种功能的顺序可比先前已知的权衡界限计算相应的多输出功能。

英文摘要:

For a decision problem from coding theory, we prove a quadratic expected time-space tradeoff of the form $\eT\eS=Ω(\tfrac{n^2}{q})$ for $q$-way deterministic decision branching programs, where $q\geq 2$. Here $\eT$ is the expected computation time and $\eS$ is the expected space, when all inputs are equally likely. This bound is to our knowledge, the first such to show an exponential size requirement whenever $\eT = O(n^2)$. Previous exponential size tradeoffs for Boolean decision branching programs were valid for time-restricted models with $T=o(n\log_2{n})$. Proving quadratic time-space tradeoffs for unrestricted time decision branching programs has been a major goal of recent research -- this goal has already been achieved for multiple-output branching programs two decades ago. We also show the first quadratic time-space tradeoffs for Boolean decision branching programs verifying circular convolution, matrix-vector multiplication and discrete Fourier transform. Furthermore, we demonstrate a constructive Boolean decision function which has a quadratic expected time-space tradeoff in the Boolean deterministic decision branching program model. When $q$ is a constant the tradeoff results derived here for decision functions verifying various functions are order-comparable to previously known tradeoff bounds for calculating the corresponding multiple-output functions.

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

↑