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

参数化 Holant 问题

Parameterised Holant Problems

Panagiotis Aivasiliotis, Andreas Göbel, Marc Roth, Johannes Schmitt

AI总结:

本文研究了签名族参数化Holant问题的复杂度,为p-Holant和p-UnColHolant分别建立了FPT近线性时间、FPT矩阵乘法时间与#W[1]-完全的详尽复杂度分类。

摘要:

我们研究了签名族 $\mathcal{S}$ 的参数化 holant 问题 p-$\mathrm{Holant}(\mathcal{S})$ 的复杂度。参数化 holant 框架由 Curticapean 于 2015 年提出,作为经典全息归约与算法理论的对应物,它构成了图状结构上着色与加权计数约束满足问题的一个庞大族,将参数化与细粒度复杂度理论中各种被广泛研究的计数问题作为特例进行编码,例如计数边着色 $k$-匹配、图因子、欧拉定向或具有加权度约束的子图。我们沿着签名集 $\mathcal{S}$ 建立了详尽的复杂度三分法:根据 $\mathcal{S}$ 的不同,p-$\mathrm{Holant}(\mathcal{S})$ 为:(1) 在 FPT-近线性时间(即 $f(k)\cdot \tilde{\mathcal{O}}(|x|)$)内可解;(2) 在“FPT-矩阵乘法时间”(即 $f(k)\cdot {\mathcal{O}}(n^ω)$)内可解,但除非 Triangle Conjecture 失败,否则无法在 FPT-近线性时间内求解;或 (3) #W[1]-完全的,且除非 ETH 失败,否则不可能比暴力穷举有显著改进。该分类揭示了参数化 Holant 复杂度图景中一个显著且令人惊讶的鸿沟:不仅每个实例要么是固定参数可解的,要么是 #W[1]-完全的,而且每个 FPT 实例均可在 $f(k)\cdot {\mathcal{O}}(n^ω)$ 时间内求解。\n我们还为参数化 holant 问题 p-$\mathrm{UnColHolant}(\mathcal{S})$ 的自然无着色版本建立了完整分类,该版本将上述示例的无着色类似物作为特例进行编码。我们证明 p-$\mathrm{UnColHolant}(\mathcal{S})$ 的复杂度有所不同:根据 $\mathcal{S}$ 的不同,所有实例要么在 FPT-近线性时间内可解,要么是 #W[1]-完全的。

英文摘要:

We investigate the complexity of parameterised holant problems p-$\mathrm{Holant}(\mathcal{S})$ for families of signatures $\mathcal{S}$. The parameterised holant framework was introduced by Curticapean in 2015 as a counter-part to the classical theory of holographic reductions and algorithms and it constitutes an extensive family of coloured and weighted counting constraint satisfaction problems on graph-like structures, encoding as special cases various well-studied counting problems in parameterised and fine-grained complexity theory such as counting edge-colourful $k$-matchings, graph-factors, Eulerian orientations or, subgraphs with weighted degree constraints. We establish an exhaustive complexity trichotomy along the set of signatures $\mathcal{S}$: Depending on $\mathcal{S}$, p-$\mathrm{Holant}(\mathcal{S})$ is: (1) solvable in FPT-near-linear time (i.e. $f(k)\cdot \tilde{\mathcal{O}}(|x|)$); (2) solvable in "FPT-matrix-multiplication time" (i.e. $f(k)\cdot {\mathcal{O}}(n^ω)$) but not solvable in FPT-near-linear time unless the Triangle Conjecture fails; or (3) #W[1]-complete and no significant improvement over brute force is possible unless ETH fails. This classification reveals a significant and surprising gap in the complexity landscape of parameterised Holants: Not only is every instance either fixed-parameter tractable or #W[1]-complete, but additionally, every FPT instance is solvable in time $f(k)\cdot {\mathcal{O}}(n^ω)$. We also establish a complete classification for a natural uncoloured version of parameterised holant problem p-$\mathrm{UnColHolant}(\mathcal{S})$, which encodes as special cases the non-coloured analogues of the aforementioned examples. We show that the complexity of p-$\mathrm{UnColHolant}(\mathcal{S})$ is different: Depending on $\mathcal{S}$ all instances are either solvable in FPT-near-linear time, or #W[1]-complete.

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

↑