On the shortest path game (Q729795): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounded-width QBF is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of path-forming games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Quantified Conjunctive (or Disjunctive) Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Subset Sum game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Path Game: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-Hardness of some combinatorial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected edge geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geography / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3512518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank

Latest revision as of 04:36, 13 July 2024

scientific article
Language Label Description Also known as
English
On the shortest path game
scientific article

    Statements

    On the shortest path game (English)
    0 references
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    shortest path problem
    0 references
    game theory
    0 references
    computational complexity
    0 references
    cactus graph
    0 references

    Identifiers

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