Robust worst cases for parity games algorithms (Q2182730): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2019.104501 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2019.104501 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2996393320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3384167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding parity games in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: ATL* Satisfiability Is 2EXPTIME-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning About Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2980973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substructure Temporal Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning About Substructures and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point logics and solitaire games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-oblivious Strategy Improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superpolynomial lower bound for strategy iteration based on snare memorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic subexponential algorithm for solving parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Deterministic Subexponential Algorithm for Solving Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Big Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parity games in big steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games via Priority Promotion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5015267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Attracting tangles to solve parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive algorithm for parity games requires exponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal μ perspective on solving parity games in quasi-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving parity games via priority promotion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmark Graphs for Practical Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3083813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2019.104501 / rank
 
Normal rank

Latest revision as of 09:31, 17 December 2024

scientific article
Language Label Description Also known as
English
Robust worst cases for parity games algorithms
scientific article

    Statements

    Robust worst cases for parity games algorithms (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2020
    0 references
    parity games
    0 references
    infinite-duration games on graphs
    0 references
    formal methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers