arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.05294cs.CCcs.DS
收藏

分支程序和分支公式的正交向量猜想

The Orthogonal Vectors Conjecture for Branching Programs and Formulas

Daniel Kane, Ryan Williams

摘要:

在正交向量(OV)问题中,我们希望确定在$d$维度中的$n$布尔向量之间是否存在正交向量对。OV猜想(OVC)假定OV需要$n^{2-o(1)}$时间来求解所有$d=ω(\log n)$。假设OVC,最优时间下限已被证明为$P$中的许多突出问题。我们证明了OVC是真的在几个计算模型的兴趣:* 对于所有足够大的$n$和$d$,OV的$n$向量在$\{0,1\}^d$分支程序的复杂性$\tildeΘ(n\cdot \min(n,2^d))$。特别地,下限匹配上界直到polylog因子。* OV在$O(1)$扇入的所有完全基上具有布尔公式复杂度$\tildeΘ(n\cdot \min(n,2^d))$。* OV需要$\tildeΘ(n\cdot \min(n,2^d))$线,在由计算无界扇入的任意对称函数的门组成的公式中。我们的下界基本上匹配这些模型中任何显式函数的最佳已知(二次)下界。类似的下界适用于许多在OVC下很难解决的相关问题,例如批处理部分匹配,批处理子集匹配和批处理汉明最近邻,所有这些都非常简洁地简化为OV。证明使用某种输入限制,这与变量独立分配的典型随机限制不同。我们给出了一种意义,其中独立的随机限制不能用于显示硬度,因为即使对于$AC^0$公式,OVC在“平均情况”下也是假的:* 对于每个固定的$p \in (0,1)$,存在$ε_p > 0$,使得对于每个$n$和$d$,OV实例,其中输入位以概率$p$独立地设置为$1$(以及$0$)可以用大小为$O(n^{2-ε_p})$的$AC^0$公式在除了$o_n(1)$部分实例之外的所有实例上求解。

英文摘要:

In the Orthogonal Vectors (OV) problem, we wish to determine if there is an orthogonal pair of vectors among $n$ Boolean vectors in $d$ dimensions. The OV Conjecture (OVC) posits that OV requires $n^{2-o(1)}$ time to solve, for all $d=ω(\log n)$. Assuming the OVC, optimal time lower bounds have been proved for many prominent problems in $P$. We prove that OVC is true in several computational models of interest: * For all sufficiently large $n$ and $d$, OV for $n$ vectors in $\{0,1\}^d$ has branching program complexity $\tildeΘ(n\cdot \min(n,2^d))$. In particular, the lower bounds match the upper bounds up to polylog factors. * OV has Boolean formula complexity $\tildeΘ(n\cdot \min(n,2^d))$, over all complete bases of $O(1)$ fan-in. * OV requires $\tildeΘ(n\cdot \min(n,2^d))$ wires, in formulas comprised of gates computing arbitrary symmetric functions of unbounded fan-in. Our lower bounds basically match the best known (quadratic) lower bounds for any explicit function in those models. Analogous lower bounds hold for many related problems shown to be hard under OVC, such as Batch Partial Match, Batch Subset Queries, and Batch Hamming Nearest Neighbors, all of which have very succinct reductions to OV. The proofs use a certain kind of input restriction that is different from typical random restrictions where variables are assigned independently. We give a sense in which independent random restrictions cannot be used to show hardness, in that OVC is false in the "average case" even for $AC^0$ formulas: * For every fixed $p \in (0,1)$ there is an $ε_p > 0$ such that for every $n$ and $d$, OV instances where input bits are independently set to $1$ with probability $p$ (and $0$ otherwise) can be solved with $AC^0$ formulas of size $O(n^{2-ε_p})$, on all but a $o_n(1)$ fraction of instances.

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

↑