求解奇偶对策的简洁进展测度
Succinct progress measures for solving parity games
摘要：
Calude等人最近发表的突破性论文给出了第一个在准多项式时间内求解奇偶博弈的算法，而以前最好的算法都是轻度次指数的。我们设计了一个替代的准多项式时间算法的基础上的进展措施，这使我们能够减少所需的空间从准多项式到近线性。我们的关键技术工具是一个新的概念，有序树编码，和一个简洁的树编码结果，我们证明使用有界自适应多计数器，这两个都是有趣的在自己的权利。
英文摘要：
The recent breakthrough paper by Calude et al. has given the first algorithm for solving parity games in quasi-polynomial time, where previously the best algorithms were mildly subexponential. We devise an alternative quasi-polynomial time algorithm based on progress measures, which allows us to reduce the space required from quasi-polynomial to nearly linear. Our key technical tools are a novel concept of ordered tree coding, and a succinct tree coding result that we prove using bounded adaptive multi-counters, both of which are interesting in their own right.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
