视远与视宽:局部图问题的体积复杂性
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
摘要:
考虑一个局部可检验但局部不可解的图问题:给定一个解,我们可以通过验证所有常数半径邻域来检验它是否可行,但要找到一个解,每个节点需要探索输入图至少到距离$Ω(\log n)$,以便产生其输出。我们从体积的角度考虑这些问题的复杂性:一个节点需要看到多大的子图才能产生它的输出。研究了有界度图上的局部可检验图问题。我们给出了一些结构,表现出确定性距离,随机距离,确定性体积和随机体积之间的权衡:-如果确定性距离是线性的,它也是已知的,随机距离是近线性的。与此相反,我们表明,有问题的线性确定性的体积,但只有对数随机体积。- 我们证明了一个随机复杂度的体积层次定理:在线性确定体积复杂度的问题中,在$Ω(\log n)$和$O(n)$之间存在无穷多个不同的随机体积复杂度类.这种层次结构仍然存在,即使限制的问题,其随机和确定性的距离复杂性是$Θ(\log n)$。- 多项式距离复杂度也存在类似的层次结构:对于任何具有$k \leq \ell$的$k, \ell \in N$,存在随机和确定性距离复杂度为$Θ(n^{1/\ell})$,随机体积复杂度为$Θ(n^{1/k})$,确定性体积复杂度为$Θ(n)$的问题。此外,我们考虑我们的体积模型和大规模并行计算(MPC)之间的连接。我们给出了一个一般的模拟参数,任何体积有效的算法可以转化为一个空间有效的MPC算法。
英文摘要:
Consider a graph problem that is locally checkable but not locally solvable: given a solution we can check that it is feasible by verifying all constant-radius neighborhoods, but to find a solution each node needs to explore the input graph at least up to distance $Ω(\log n)$ in order to produce its output. We consider the complexity of such problems from the perspective of volume: how large a subgraph does a node need to see in order to produce its output. We study locally checkable graph problems on bounded-degree graphs. We give a number of constructions that exhibit tradeoffs between deterministic distance, randomized distance, deterministic volume, and randomized volume: - If the deterministic distance is linear, it is also known that randomized distance is near-linear. In contrast, we show that there are problems with linear deterministic volume but only logarithmic randomized volume. - We prove a volume hierarchy theorem for randomized complexity: among problems with linear deterministic volume complexity, there are infinitely many distinct randomized volume complexity classes between $Ω(\log n)$ and $O(n)$. This hierarchy persists even when restricting to problems whose randomized and deterministic distance complexities are $Θ(\log n)$. - Similar hierarchies exist for polynomial distance complexities: for any $k, \ell \in N$ with $k \leq \ell$, there are problems whose randomized and deterministic distance complexities are $Θ(n^{1/\ell})$, randomized volume complexities are $Θ(n^{1/k})$, and whose deterministic volume complexities are $Θ(n)$. Additionally, we consider connections between our volume model and massively parallel computation (MPC). We give a general simulation argument that any volume-efficient algorithm can be transformed into a space-efficient MPC algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。