The complexity of mean payoff games on graphs (Q1351468): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(95)00188-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026128612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in extensive form perfect information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of path-forming games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Lower Bounds on the Exact Complexity of String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff 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: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical games with prohibitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4007400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential randomized algorithm for the simple stochastic game problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster parametric shortest path and minimum‐balance algorithms / rank
 
Normal rank

Latest revision as of 11:10, 27 May 2024

scientific article
Language Label Description Also known as
English
The complexity of mean payoff games on graphs
scientific article

    Statements

    The complexity of mean payoff games on graphs (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    pseudo-polynomial time algorithm
    0 references
    polynomial reduction
    0 references
    0 references