随机到达问题
The Stochastic Arrival Problem
AI总结:
该研究提出含切换、随机及受控节点的Arrival问题新变体,基于Reachability Switching Games研究其复杂度,证明仅含切换与随机节点的版本判定值大于1/2是PP难的,并给出PSPACE判定算法。
摘要:
我们研究了到达(Arrival)问题的一种新变体,该问题除切换节点外,还允许存在兼具随机行为与受控行为的节点。我们基于可达性切换博弈(Reachability Switching Games)的现有研究,分析了这些扩展的计算复杂度。具体而言,我们证明:对于仅包含切换节点和随机节点的到达问题版本,判定其值是否大于二分之一是PP难的,同时我们给出了一种PSPACE判定算法。
英文摘要:
We study a new modification of the Arrival problem, which allows for nodes that exhibit random as well as controlled behaviour, in addition to switching nodes. We study the computational complexity of these extensions, building on existing work on Reachability Switching Games. In particular, we show for versions of the arrival problem involving just switching and random nodes it is \PP{}-hard to decide if their value is greater than a half and we give a PSPACE decision algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。