一种拟多项式时间内求解奇偶博弈的递归方法
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
AI总结：
本文改进Zielonka经典递归算法，将奇偶博弈求解复杂度从指数级降至拟多项式级，达到$n^{O(\log(1+d/\log n))}$。
摘要：
Zielonka的经典递归算法是众多现有奇偶博弈算法中最简单的之一，但其复杂度为指数级，而当前最先进的算法已达到拟多项式复杂度。本文提出对Zielonka经典算法的改进，将其复杂度降至$n^{O\left(\log\left(1+\frac{d}{\log n}\right)\right)}$，适用于规模为$n$、优先级数为$d$的奇偶博弈，与先前拟多项式时间解决方案一致。
英文摘要：
Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have quasipolynomial complexity. Here, we present a modification of Zielonka's classic algorithm that brings its complexity down to $n^{O\left(\log\left(1+\frac{d}{\log n}\right)\right)}$, for parity games of size $n$ with $d$ priorities, in line with previous quasipolynomial-time solutions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
