Pages that link to "Item:Q4977976"

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

Displaying 29 items.

• Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
• (Q5111624) (← links)
• (Q5207047) (← links)
• (Q5227517) (← links)
• (Q5232902) (← links)
• Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
• (Q5875369) (← links)
• (Q5875379) (← links)
• (Q5875380) (← links)
• Synthesis of Data Word Transducers (Q5875385) (← links)
• (Q5875386) (← links)
• (Q5875397) (← links)
• On the complexity of rational verification (Q6133701) (← links)
• Church synthesis on register automata over linearly ordered data domains (Q6151760) (← links)
• Token Games and History-Deterministic Quantitative-Automata (Q6178674) (← links)
• On-the-fly solving for symbolic parity games (Q6535612) (← links)
• Proof systems for the modal \(\mu \)-calculus obtained by determinizing automata (Q6541156) (← links)
• From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
• On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations (Q6573335) (← links)
• Operations on fixpoint equation systems (Q6597955) (← links)
• Complexity results for modal logic with recursion via translations and tableaux (Q6597964) (← links)
• Priority promotion with Parysian flair (Q6627044) (← links)
• Symbolic solution of Emerson-Lei games for reactive synthesis (Q6629450) (← links)
• Parity games on temporal graphs (Q6629452) (← links)
• Synthesis with privacy against an observer (Q6629463) (← links)
• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms (Q6647769) (← links)
• Size measures and alphabetic equivalence in the \(\mu \)-calculus (Q6649448) (← links)
• New algorithms for combinations of objectives using separating automata (Q6649527) (← links)
• On the size of disjunctive formulas in the \(\mu\)-calculus (Q6649531) (← links)