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

VC维的一种变形及其在深度3电路中的应用

A Variant of the VC-dimension with Applications to Depth-3 Circuits

Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard

摘要:

我们引入VC维的以下变体。给定$S \subseteq \{0, 1\}^n$和正整数$d$,我们将$\mathbb{U}_d(S)$定义为最大子集$I \subseteq [n]$的大小,使得$S$在大小为$d$的$I$的每个子集上的投影是$d$维立方体。证明了在给定$\mathbb{U}_d$维数的情况下,确定一个集合的最大基数等价于一个与$d$ -一致超图的团总数有关的Turán型问题.这使我们能够击败这个维数概念的绍尔-谢拉引理。我们利用这一点得到了几个关于$Σ_3^k$ -电路的结果,即,深度- $3$电路,其具有顶部门OR和底部扇入至多$k$:* $2$-CNF的满意分配的数量与其所接受的最大投影的维度之间的紧密关系,从而改进了Paturi、Saks和Zane(Comput.复杂. '00)。* 改进的次线性维数仿射扩散器的$Σ_3^3$ -回路下界。此外,我们提出了一个纯粹的超图理论的猜想下,我们得到进一步的改进。* 我们在解决$\mathbb{F}_2$上的内积函数和所有次数$2$多项式的$Σ_3^2$复杂性方面取得了进展。确定IP的$Σ_3^3$复杂性的问题最近由Golovnev、Kulikov和Williams提出(ITCS'21)。

英文摘要:

We introduce the following variant of the VC-dimension. Given $S \subseteq \{0, 1\}^n$ and a positive integer $d$, we define $\mathbb{U}_d(S)$ to be the size of the largest subset $I \subseteq [n]$ such that the projection of $S$ on every subset of $I$ of size $d$ is the $d$-dimensional cube. We show that determining the largest cardinality of a set with a given $\mathbb{U}_d$ dimension is equivalent to a Turán-type problem related to the total number of cliques in a $d$-uniform hypergraph. This allows us to beat the Sauer--Shelah lemma for this notion of dimension. We use this to obtain several results on $Σ_3^k$-circuits, i.e., depth-$3$ circuits with top gate OR and bottom fan-in at most $k$: * Tight relationship between the number of satisfying assignments of a $2$-CNF and the dimension of the largest projection accepted by it, thus improving Paturi, Saks, and Zane (Comput. Complex. '00). * Improved $Σ_3^3$-circuit lower bounds for affine dispersers for sublinear dimension. Moreover, we pose a purely hypergraph-theoretic conjecture under which we get further improvement. * We make progress towards settling the $Σ_3^2$ complexity of the inner product function and all degree-$2$ polynomials over $\mathbb{F}_2$ in general. The question of determining the $Σ_3^3$ complexity of IP was recently posed by Golovnev, Kulikov, and Williams (ITCS'21).

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

↑