Pages that link to "Item:Q4977976"

The following pages link to Deciding parity games in quasipolynomial time (Q4977976):

Displaying 50 items.

• A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
• Solving parity games via priority promotion (Q1742991) (← links)
• Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
• New deterministic algorithms for solving parity games (Q1756345) (← links)
• A delayed promotion policy for parity games (Q1784960) (← links)
• Improving parity games in practice (Q2043434) (← links)
• Quasipolynomial computation of nested fixpoints (Q2044189) (← links)
• The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
• Bounded game-theoretic semantics for modal mu-calculus (Q2105468) (← links)
• Timed games with bounded window parity objectives (Q2112117) (← links)
• Linear temporal logic -- from infinite to finite horizon (Q2147173) (← links)
• Finite-state strategies in delay games (Q2182729) (← links)
• Robust worst cases for parity games algorithms (Q2182730) (← links)
• Abstract tropical linear programming (Q2188843) (← links)
• Infinite-duration poorman-bidding games (Q2190378) (← links)
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
• Synthesizing optimally resilient controllers (Q2303880) (← links)
• Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
• Approximating the minimal lookahead needed to win infinite games (Q2671807) (← links)
• Robust, expressive, and quantitative linear temporal logics: pick any two for free (Q2672232) (← links)
• A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
• Cooking Your Own Parity Game Preorders Through Matching Plays (Q3177339) (← links)
• Width of Non-deterministic Automata (Q3304146) (← links)
• (Q3384162) (← links)
• (Q3384167) (← links)
• (Q3384169) (← links)
• (Q3384876) (← links)
• (Q3384882) (← links)
• A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
• (Q4553289) (← links)
• Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width (Q4927428) (← links)
• $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
• Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems (Q5005159) (← links)
• Learning-Based Mean-Payoff Optimization in an Unknown MDP under Omega-Regular Constraints (Q5009420) (← links)
• (Q5009445) (← links)
• (Q5020527) (← links)
• (Q5020998) (← links)
• The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• Synthesizing Optimally Resilient Controllers (Q5079759) (← links)
• (Q5079761) (← links)
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
• (Q5089290) (← links)
• (Q5090455) (← links)
• Büchi Good-for-Games Automata Are Efficiently Recognizable (Q5090951) (← links)
• On the Way to Alternating Weak Automata (Q5090957) (← links)
• (Q5091276) (← links)
• Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
• (Q5111624) (← links)
• (Q5207047) (← links)