The Rabin index of parity games: its complexity and approximation (Q897647): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Rabin Index of a Parity Automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fatal Attractors in Parity 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: On ω-regular sets / 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 03:39, 11 July 2024

scientific article
Language Label Description Also known as
English
The Rabin index of parity games: its complexity and approximation
scientific article

    Statements

    The Rabin index of parity games: its complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2015
    0 references
    logic in computer science
    0 references
    paths and cycles
    0 references
    computational difficulty of problems
    0 references
    descriptive complexity
    0 references
    specification and verification
    0 references
    parity games
    0 references
    game graphs
    0 references
    Rabin index
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references