Computational complexity of winning strategies in two-person polynomial games (Q1190954): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of Quantifier Prefixes Over Diophantine Equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some undecidable determined games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3245637 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4131648 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational complexities of diophantine equations with parameters / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5605051 / rank | |||
Normal rank |
Revision as of 12:11, 16 May 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