递归到达问题
The Recursive Arrival Problem
AI总结:
本文提出递归式 Arrival 扩展并分析其复杂性,证明判定问题属于 NP∩coNP 且 P 困难,搜索问题属于 UEOPL。
摘要:
我们研究 Arrival 问题的一个扩展,称为 Recursive Arrival,其灵感来自 Recursive State Machines(递归状态机),允许一族能够以递归方式相互调用的切换图。我们研究判定一个 Recursive Arrival 实例是否在给定目标顶点终止的计算复杂性。我们证明该问题包含于 NP ∩ coNP,并证明该问题的搜索版本位于 UEOPL 中,因此位于 EOPL = PLS ∩ PPAD 中。此外,我们证明 Recursive Arrival 判定问题具有 P 困难性。相比之下,目前 Arrival 最著名的困难性结果是 PL 困难性。
英文摘要:
We study an extension of the Arrival problem, called Recursive Arrival, inspired by Recursive State Machines, which allows for a family of switching graphs that can call each other in a recursive way. We study the computational complexity of deciding whether a Recursive Arrival instance terminates at a given target vertex. We show this problem is contained in NP \cap coNP, and we show that a search version of the problem lies in UEOPL, and hence in EOPL = PLS \cap PPAD. Furthermore, we show P-hardness of the Recursive Arrival decision problem. By contrast, the current best-known hardness result for Arrival is PL-hardness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。