The complexity of mean payoff games on graphs (Q1351468)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of mean payoff games on graphs |
scientific article; zbMATH DE number 984399
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of mean payoff games on graphs |
scientific article; zbMATH DE number 984399 |
Statements
The complexity of mean payoff games on graphs (English)
0 references
27 February 1997
0 references
pseudo-polynomial time algorithm
0 references
polynomial reduction
0 references
0 references
0 references
0 references
0.9383715
0 references
0.92923135
0 references
0.9282171
0 references
0 references
0.8996134
0 references
0.8979161
0 references
