Strategy Construction for Parity Games with Imperfect Information (Q3541028): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147830304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategy Construction for Parity Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Omega-Regular Games with Imperfect Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816007 / 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: Q4449227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games played on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of strategies in infinite games / 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

Latest revision as of 21:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Strategy Construction for Parity Games with Imperfect Information
scientific article

    Statements

    Strategy Construction for Parity Games with Imperfect Information (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references