奇偶kill数的一个合成定理
A composition theorem for parity kill number
摘要:
在这项工作中,我们研究的奇偶校验复杂性措施${\mathsf{C}^{\oplus}_{\min}}[f]$和${\mathsf{DT^{\oplus}}}[f]$。${\mathsf{C}^{\oplus}_{\min}}[f]$是$f$的\emph{parity kill number},为了“杀死”$f$,即使其恒定,必须在输入变量上固定最少数量的奇偶校验。${\mathsf{DT^{\oplus}}}[f]$是计算$f$的最短\emph{parity decision tree}的深度。近年来,这些复杂性度量在通信复杂性\cite{ZS09, MO09, ZS10, TWXZ13}和伪随机性\cite{BK12, Sha11, CT13}领域中变得越来越重要。我们的主要结果是${\mathsf{C}^{\oplus}_{\min}}$的一个复合定理。$f$的$k$次幂,表示为$f^{\circ k}$,是将$f$与其自身的$k$次组合而得到的函数。我们证明,如果$f$不是一个奇偶校验函数,那么${\mathsf{C}^{\oplus}_{\min}}[f^{\circ k}] \geq Ω({\mathsf{C}_{\min}}[f]^{k}).$换句话说,$f$的奇偶校验杀死数在$f$的\emph{normal}杀死数(也称为最小证书复杂度)中本质上是超乘法的。作为我们的复合定理的应用,我们证明了$\mathsf{Sort}^{\circ k}$和$\mathsf{HI}^{\circ k}$的奇偶复杂性测度的下界。这里$\mathsf{Sort}$是Ambainis \cite{Amb06}的排序函数,$\mathsf{HI}$是Kushilevitz的半二十面体函数\cite{NW95}。在这样做的过程中,我们反驳了一个猜想的Montanaro和奥斯本\cite{MO09}通信复杂性和计算学习理论的应用。此外,我们给出了\cite{MO09,ZS10}和\cite{TWXZ13}的新的下界。
英文摘要:
In this work, we study the parity complexity measures ${\mathsf{C}^{\oplus}_{\min}}[f]$ and ${\mathsf{DT^{\oplus}}}[f]$. ${\mathsf{C}^{\oplus}_{\min}}[f]$ is the \emph{parity kill number} of $f$, the fewest number of parities on the input variables one has to fix in order to "kill" $f$, i.e. to make it constant. ${\mathsf{DT^{\oplus}}}[f]$ is the depth of the shortest \emph{parity decision tree} which computes $f$. These complexity measures have in recent years become increasingly important in the fields of communication complexity \cite{ZS09, MO09, ZS10, TWXZ13} and pseudorandomness \cite{BK12, Sha11, CT13}. Our main result is a composition theorem for ${\mathsf{C}^{\oplus}_{\min}}$. The $k$-th power of $f$, denoted $f^{\circ k}$, is the function which results from composing $f$ with itself $k$ times. We prove that if $f$ is not a parity function, then ${\mathsf{C}^{\oplus}_{\min}}[f^{\circ k}] \geq Ω({\mathsf{C}_{\min}}[f]^{k}).$ In other words, the parity kill number of $f$ is essentially supermultiplicative in the \emph{normal} kill number of $f$ (also known as the minimum certificate complexity). As an application of our composition theorem, we show lower bounds on the parity complexity measures of $\mathsf{Sort}^{\circ k}$ and $\mathsf{HI}^{\circ k}$. Here $\mathsf{Sort}$ is the sort function due to Ambainis \cite{Amb06}, and $\mathsf{HI}$ is Kushilevitz's hemi-icosahedron function \cite{NW95}. In doing so, we disprove a conjecture of Montanaro and Osborne \cite{MO09} which had applications to communication complexity and computational learning theory. In addition, we give new lower bounds for conjectures of \cite{MO09,ZS10} and \cite{TWXZ13}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。