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

比较器电路的收缩算法及其下界

Algorithms and Lower Bounds for Comparator Circuits from Shrinkage

Bruno P. Cavalar, Zhenjian Lu

摘要:

比较器电路是研究有界扇出计算的一种自然电路模型,其性能介于不确定分支程序和一般电路之间。尽管已经研究了近三十年,但直到最近Gál和Robere(ITCS 2020)才证明了第一个针对比较器电路的超线性下限,他们建立了计算$n$位的显式函数的比较器电路大小的$Ω((n/\log n)^{1.5})$下限。本文主要研究比较器电路的平均情况复杂度和电路分析算法。从以前的方法出发,我们利用随机约束下的收缩技术,获得了各种新的结果,这个模型。其中,我们显示-平均情况下的下限。对于每一个具有$k \geq \log n$的$k = k(n)$,在$n$位上存在一个多项式时间可计算函数$f_k$,使得对于每一个具有最多$n^{1.5}/O(k\cdot \sqrt{\log n})$门的比较器电路$C$,我们有\[ \text{Pr}_{x\in\left\{ 0,1 \right\}^n}\left[C(x)=f_k(x)\right]\leq \frac{1}{2} + \frac{1}{2^{Ω(k)}}. \]这个平均情况下的下限通过让$k=O(\log n)$匹配Gál和Robere的最坏情况下的下限。- #SAT算法存在一种算法,该算法针对任何$k\leq n/4$,在时间$2^{n-k}\cdot\text{poly}(n)$上对具有最多$n^{1.5}/O\!\left(k\cdot \sqrt{\log n}\right)$门的给定比较器电路的满意分配的数目进行计数。当$k=ω(\log n)$。- 伪随机生成器和MCSP下界。有一个种子长度为$s^{2/3+o(1)}$的伪随机发生器,它用$s$门欺骗比较器电路。此外,使用这个PRG,我们得到了一个$n^{1.5-o(1)}$下限MCSP对比较器电路。

英文摘要:

Comparator circuits are a natural circuit model for studying bounded fan-out computation whose power sits between nondeterministic branching programs and general circuits. Despite having been studied for nearly three decades, the first superlinear lower bound against comparator circuits was proved only recently by Gál and Robere (ITCS 2020), who established a $Ω((n/\log n)^{1.5})$ lower bound on the size of comparator circuits computing an explicit function of $n$ bits. In this paper, we initiate the study of average-case complexity and circuit analysis algorithms for comparator circuits. Departing from previous approaches, we exploit the technique of shrinkage under random restrictions to obtain a variety of new results for this model. Among them, we show - Average-case Lower Bounds. For every $k = k(n)$ with $k \geq \log n$, there exists a polynomial-time computable function $f_k$ on $n$ bits such that, for every comparator circuit $C$ with at most $n^{1.5}/O(k\cdot \sqrt{\log n})$ gates, we have \[ \text{Pr}_{x\in\left\{ 0,1 \right\}^n}\left[C(x)=f_k(x)\right]\leq \frac{1}{2} + \frac{1}{2^{Ω(k)}}. \] This average-case lower bound matches the worst-case lower bound of Gál and Robere by letting $k=O(\log n)$. - #SAT Algorithms. There is an algorithm that counts the number of satisfying assignments of a given comparator circuit with at most $n^{1.5}/O\!\left(k\cdot \sqrt{\log n}\right)$ gates, in time $2^{n-k}\cdot\text{poly}(n)$, for any $k\leq n/4$. The running time is non-trivial when $k=ω(\log n)$. - Pseudorandom Generators and MCSP Lower Bounds. There is a pseudorandom generator of seed length $s^{2/3+o(1)}$ that fools comparator circuits with $s$ gates. Also, using this PRG, we obtain an $n^{1.5-o(1)}$ lower bound for MCSP against comparator circuits.

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

↑