scientific article; zbMATH DE number 7650845

DOI10.4230/LIPIcs.CSL.2020.32MaRDI QIDQ5874219

Paweł Parys

Publication date: 7 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parity gamesquasi-polynomial timegood-for-games automataseparating automata

Mathematics Subject Classification ID

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

Related Items (3)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Unnamed Item ⋮ Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games

This page was built for publication: