pith. sign in

arxiv: 1702.01953 · v4 · pith:ITZUUIN3new · submitted 2017-02-07 · 💻 cs.FL · cs.GT

A short proof of correctness of the quasi-polynomial time algorithm for parity games

Hugo Gimbert (LaBRI) , Rasmus Ibsen-Jensen (IST Austria) This is my paper
classification 💻 cs.FL cs.GT
keywords algorithmcorrectnessgamesparityproofquasi-polynomialshorttime
0
0 comments X
read the original abstract

Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short proof of correctness of their algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Equilibria in Multiplayer Graph Games: An Algorithmic Study

    cs.GT 2026-05 unverdicted novelty 5.0

    Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.