arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.03285cs.CC
收藏

基于冲突复杂性的合成定理

A Composition Theorem via Conflict Complexity

Swagato Sanyal

摘要:

让$\R(\cdot)$代表有界错误随机化查询复杂度。我们证明了对于任何关系$f \subseteq \{0,1\}^n \times \mathcal{S}$和偏布尔函数$g \subseteq \{0,1\}^n \times \{0,1\}$,$\R_{1/3}(f \circ g^n) = Ω(\R_{4/9}(f) \cdot \sqrt{\R_{1/3}(g)})$ .独立于我们,Gavinsky、Lee和Santha \cite{newcomp}证明了这个结果。通过一个例子证明了这个界是最优的。我们证明了我们的结果,通过引入一种新的复杂性措施称为\emph{conflict complexity}的部分布尔函数$g$,表示为$χ(g)$,这可能是独立的利益。我们证明了$χ(g) = Ω(\sqrt{\R(g)})$和$\R(f \circ g^n) = Ω(\R(f) \cdot χ(g))$ .

英文摘要:

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) = Ω(\R_{4/9}(f) \cdot \sqrt{\R_{1/3}(g)})$. Independently of us, Gavinsky, Lee and Santha \cite{newcomp} proved this result. By an example demonstrated in their work, this bound is optimal. We prove our result by introducing a novel complexity measure called the \emph{conflict complexity} of a partial Boolean function $g$, denoted by $χ(g)$, which may be of independent interest. We show that $χ(g) = Ω(\sqrt{\R(g)})$ and $\R(f \circ g^n) = Ω(\R(f) \cdot χ(g))$.

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

↑