Computational complexity of winning strategies in two-person polynomial games (Q1190954)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of winning strategies in two-person polynomial games |
scientific article |
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
