Deterministic Graphical Games Revisited (Q5900106): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / 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: Contributions to the Theory of Games (AM-39), Volume III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for a class of bottleneck problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player stochastic games. I: A reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-player stochastic games. II: The case of recursive games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic graphical games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Latest revision as of 11:23, 28 June 2024

scientific article; zbMATH DE number 5291015
Language Label Description Also known as
English
Deterministic Graphical Games Revisited
scientific article; zbMATH DE number 5291015

    Statements

    Identifiers

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