Computational complexity of winning strategies in two-person polynomial games (Q1190954): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:28, 5 March 2024
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