Computational complexity of winning strategies in two-person polynomial games

DOI10.1007/BF02112429zbMath0835.90152OpenAlexW2064429628MaRDI QIDQ1190954

S. Singh

Publication date: 27 September 1992

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02112429

zbMATH Keywords

NP-completenesspolynomial time computable winning strategy

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial games (91A46)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some undecidable determined games
• Computational complexities of diophantine equations with parameters
• Classification of Quantifier Prefixes Over Diophantine Equations
• Reduction of an arbitrary diophantine equation to one in 13 unknowns