scientific article; zbMATH DE number 7650845

DOI10.4230/LIPICS.CSL.2020.32MaRDI QIDQ5874219zbMATH OpenFDO

Authors Paweł Parys

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1910.03919

zbMATH Keywords

good-for-games automataparity gamesquasi-polynomial timeseparating automata

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cited in

(8)

• scientific article; zbMATH DE number 6374006 (Why is no real title available?)
• Algorithms for Parity Games
• A recursive approach to solving parity games in quasipolynomial time
• The Theory of Universal Graphs for Infinite Duration Games
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
• Parallel repetition for all 3-player games over binary alphabet
• Priority promotion with Parysian flair
• The Strahler number of a parity game

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874219)