最短复位字的强不可逼近性
Strong inapproximability of the shortest reset word
摘要:
Černandi猜想指出,每个$n$状态同步自动机都有一个长度最多为$(n-1)^2$的复位字.我们研究了寻找短重置词的难度。已知该问题的确切版本,即,找到最短复位字是NP难的和coNP难的,并且对于DP类是完全的,并且即使对于二进制字母表[Berlinkov,DLT ′ 13],在因子$O(\log n)$内近似最短复位字的长度也是NP难的[Gerbush和Heeringa,CIAA ′ 10]。我们显着改善这些结果表明,对于每一个$ε>0$,这是NP-难近似的最短复位字的长度在一个因素的$n^{1-ε}$。由于存在简单的$O(n)$ -近似算法,因此这基本上是紧密的。
英文摘要:
The Černý conjecture states that every $n$-state synchronizing automaton has a reset word of length at most $(n-1)^2$. We study the hardness of finding short reset words. It is known that the exact version of the problem, i.e., finding the shortest reset word, is NP-hard and coNP-hard, and complete for the DP class, and that approximating the length of the shortest reset word within a factor of $O(\log n)$ is NP-hard [Gerbush and Heeringa, CIAA'10], even for the binary alphabet [Berlinkov, DLT'13]. We significantly improve on these results by showing that, for every $ε>0$, it is NP-hard to approximate the length of the shortest reset word within a factor of $n^{1-ε}$. This is essentially tight since a simple $O(n)$-approximation algorithm exists.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。