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

有限系统上双模拟与模拟的复杂性

The Complexity of Bisimulation and Simulation on Finite Systems

Moses Ganardi, Stefan Göller, Markus Lohrey

AI总结:

本文研究了受限图类上(双)模拟问题的计算复杂性,解决了开放问题,并证明了有界路径宽度图的模拟问题是P完全的。

摘要:

本文研究了受限图类上(双)模拟问题的计算复杂性。对于以指针结构或项给出的树,(双)模拟问题分别对于对数空间或NC$^1$是完全的。这解决了Balcázar、Gabarró和Sántha提出的一个开放问题。此外,如果仅要求两个输入图之一是树,则双模拟(模拟)问题包含在AC$^1$(LogCFL)中。相反,本文还表明,对于有界路径宽度的图,模拟问题已经是P完全的。

英文摘要:

In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$, respectively. This solves an open problem from Balcázar, Gabarró, and Sántha. Furthermore, if only one of the input graphs is required to be a tree, the bisimulation (simulation) problem is contained in AC$^1$ (LogCFL). In contrast, it is also shown that the simulation problem is P-complete already for graphs of bounded path-width.

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

↑