Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343)
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: Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games |
scientific article; zbMATH DE number 6699605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games |
scientific article; zbMATH DE number 6699605 |
Statements
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (English)
0 references
3 April 2017
0 references
0 references
0 references
0.9622084498405457
0 references
0.7843924164772034
0 references
0.7587655782699585
0 references
0.7538877129554749
0 references
0.7527093887329102
0 references
