Computational complexity of winning strategies in two-person polynomial games (Q1190954)
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: Computational complexity of winning strategies in two-person polynomial games |
scientific article; zbMATH DE number 58718
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of winning strategies in two-person polynomial games |
scientific article; zbMATH DE number 58718 |
Statements
Computational complexity of winning strategies in two-person polynomial games (English)
0 references
27 September 1992
0 references
See the review in Zbl 0757.90097.
0 references
polynomial time computable winning strategy
0 references
NP-completeness
0 references
0.8999524
0 references
0.8810473
0 references
0.8747982
0 references
0 references
0.86188996
0 references
0.86042243
0 references
