arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1608.04355cs.DScs.CC
收藏

阈值函数的多项式表示及其数学应用

Polynomial Representations of Threshold Functions and Algorithmic Applications

Josh Alman, Timothy M. Chan, Ryan Williams

摘要:

我们设计了新的多项式,用于表示三种不同状态下的阈值函数:低次数的概率多项式,其需要比以前的构造少得多的随机性,具有“好”阈值行为和次数几乎与概率多项式一样低的多项式阈值函数(PTF),以及概率PTF的新概念,其中我们结合上述技术以实现具有类似“好”阈值行为的甚至更低的程度。利用这些多项式结构,我们设计了各种问题的更快的算法:$\bullet$离线汉明最近(和Furminent)邻居:给定$d=c\log n$的$d$维汉明空间中的$n$红色和$n$蓝色点,我们可以在随机时间$n^{2-1/O(\sqrt{c}\log^{2/3}c)}$或确定性时间$n^{2-1/O(c\log^2c)}$中为每个红色点找到(精确)最近(或最远)蓝色邻居。这些也导致更快的MAX-SAT算法稀疏CNF。$\bullet$离线近似最近(和最远)邻居:给定$\bullet$维$\ell_1$或欧几里德空间中的$n$红色和$n$蓝色点,我们可以在随机时间内找到$dn+n^{2-Ω(ε^{1/3}/\log(1/ε))}$附近的每个红色点的$(1+ε)$近似最近(或最远)蓝色邻居.具有线性阈值函数的电路的$\bullet$ SAT算法和下限:我们给出了$AC^0[m]\circ LTF\circ LTF$电路的可满足性算法,该电路在底层具有次二次数量的线性阈值门,在其他层具有次指数数量的门,该算法在确定性$2^{n-n^ε}$时间内运行。这也意味着阈值电路的新的电路下限。我们还给出了一个随机$2^{n-n^ε}$时间SAT算法的次指数大小的$MAJ\circ AC^0\circ LTF\circ AC^0\circ LTF$电路,其中顶部$MAJ$门和中间$LTF$门有$O(n^{6/5-δ})$扇入。

英文摘要:

We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with "nice" threshold behavior and degree almost as low as the probabilistic polynomials, and a new notion of probabilistic PTFs where we combine the above techniques to achieve even lower degree with similar "nice" threshold behavior. Utilizing these polynomial constructions, we design faster algorithms for a variety of problems: $\bullet$ Offline Hamming Nearest (and Furthest) Neighbors: Given $n$ red and $n$ blue points in $d$-dimensional Hamming space for $d=c\log n$, we can find an (exact) nearest (or furthest) blue neighbor for every red point in randomized time $n^{2-1/O(\sqrt{c}\log^{2/3}c)}$ or deterministic time $n^{2-1/O(c\log^2c)}$. These also lead to faster MAX-SAT algorithms for sparse CNFs. $\bullet$ Offline Approximate Nearest (and Furthest) Neighbors: Given $n$ red and $n$ blue points in $d$-dimensional $\ell_1$ or Euclidean space, we can find a $(1+ε)$-approximate nearest (or furthest) blue neighbor for each red point in randomized time near $dn+n^{2-Ω(ε^{1/3}/\log(1/ε))}$. $\bullet$ SAT Algorithms and Lower Bounds for Circuits With Linear Threshold Functions: We give a satisfiability algorithm for $AC^0[m]\circ LTF\circ LTF$ circuits with a subquadratic number of linear threshold gates on the bottom layer, and a subexponential number of gates on the other layers, that runs in deterministic $2^{n-n^ε}$ time. This also implies new circuit lower bounds for threshold circuits. We also give a randomized $2^{n-n^ε}$-time SAT algorithm for subexponential-size $MAJ\circ AC^0\circ LTF\circ AC^0\circ LTF$ circuits, where the top $MAJ$ gate and middle $LTF$ gates have $O(n^{6/5-δ})$ fan-in.

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

↑