A quasi-polynomial black-box algorithm for fixed point evaluation
From MaRDI portal
Cites work
- A deterministic subexponential algorithm for solving parity games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- An improved algorithm for the evaluation of fixpoint expressions
- Deciding parity games in quasipolynomial time
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Fast and simple nested fixpoints
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Monadic second order logic on tree-like structures
- On model checking for the -calculus and its fragments
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Permissive strategies: from parity games to safety games
- Quasipolynomial set-based symbolic algorithms for parity games
- Rudiments of \(\mu\)-calculus
- Some results on complexity of -calculus evaluation in the black-box model
- Succinct progress measures for solving parity games
- Universal graphs and good for games automata: new tools for infinite duration games
- Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games
This page was built for publication: A quasi-polynomial black-box algorithm for fixed point evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839831)
