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

ARRIVAL的一个简单下界

A simple lower bound for ARRIVAL

Graham Manuell

摘要:

由Dohrau、Gärtner、Kohler、Matoušek和Welzl提出的ARRIVIAL问题涉及一列训练在有向图上沿着向外的边移动,根据每个顶点上的“开关”的位置,每当训练经过它们时,这些开关又被切换。这个问题询问训练是否都到达指定的目的地顶点。已知ARRIVAL包含在UP $\cap$ coUP中,而先前最好的公开下界是它是NL-硬的。在本说明中,我们提供了一个简单的减少$\mathsf{DIGICOMP}_\mathsf{EXP}$问题考虑Aaronson。特别是,ARRIVAL是CC-hard和PL-hard。

英文摘要:

The ARRIVIAL problem introduced by Dohrau, Gärtner, Kohler, Matoušek and Welzl concerns a train moving on a directed graph proceeding along outward edges according to the position of 'switches' at each vertex, which in turn are toggled whenever the train passes through them. The problem asks whether the train every reaches a designated destination vertex. It is known that ARRIVAL is contained in UP $\cap$ coUP, while the previously best published lower bound is that it is NL-hard. In this note we provide a simple reduction to the $\mathsf{DIGICOMP}_\mathsf{EXP}$ problem considered by Aaronson. It follows in particular that ARRIVAL is both CC-hard and PL-hard.

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

↑