The complexity of mean payoff games on graphs (Q1351468)

From MaRDI portal
Revision as of 04:03, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The complexity of mean payoff games on graphs
scientific article

    Statements

    title
    The complexity of mean payoff games on graphs (English)
    0 references
    author
    Uri Zwick
    0 references
    Mike S. Paterson
    0 references
    publication date
    27 February 1997
    0 references
    zbMATH DE Number
    984399
    0 references
    zbMATH Keywords
    pseudo-polynomial time algorithm
    0 references
    polynomial reduction
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1351468&oldid=26169977"
    Powered by MediaWiki