Garden-Hose模型的新界
New Bounds for the Garden-Hose Model
摘要:
我们展示了花园软管模型的新结果。我们的主要结果包括改进的下界的基础上非确定性的通信复杂性(导致以前未知的$Θ(n)$边界的内积模2和Disjointness),以及$O(n\cdot \log^3 n)$上界的分布多数函数(以前被证明有二次复杂性)。我们显示了一个有效的模拟公式的AND,OR,“异”门的花园软管模型,这意味着花园软管的顺序$Ω(n^{2+ε})$的复杂性$GH(f)$的下界将很难获得显式函数。此外,我们研究了一个时间有界的模型,在该模型中,即使是适度的节省时间可以导致指数下限的花园软管协议的大小。
英文摘要:
We show new results about the garden-hose model. Our main results include improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown $Θ(n)$ bounds for Inner Product mod 2 and Disjointness), as well as an $O(n\cdot \log^3 n)$ upper bound for the Distributed Majority function (previously conjectured to have quadratic complexity). We show an efficient simulation of formulae made of AND, OR, XOR gates in the garden-hose model, which implies that lower bounds on the garden-hose complexity $GH(f)$ of the order $Ω(n^{2+ε})$ will be hard to obtain for explicit functions. Furthermore we study a time-bounded variant of the model, in which even modest savings in time can lead to exponential lower bounds on the size of garden-hose protocols.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。