Computational complexity of winning strategies in two-person polynomial games
type: Item
instance of: scholarly article
title: Computational complexity of winning strategies in two-person polynomial games
zbMATH Open document ID: 0835.90152
DOI: 10.1007/BF02112429
author: S. Singh
published in: Journal of Mathematical Sciences (New York)
publication date: 1992-09-27T00:00:00Z
review text: See the review in Zbl 0757.90097.
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 58718
zbMATH Keywords: polynomial time computable winning strategy
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
cites work: Classification of Quantifier Prefixes Over Diophantine Equations
cites work: Some undecidable determined games
cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns
cites work: Q3245637
cites work: Q4131648
cites work: Computational complexities of diophantine equations with parameters
cites work: Q5605051
full work available at URL: https://doi.org/10.1007/bf02112429
OpenAlex ID: W2064429628
Recommended article: Q3362311
Recommended article: Q3984859
Recommended article: Complexity of Winning Strategies for Δ 0 2 Games
Recommended article: On the complexity of computing winning strategies for finite poset games
Recommended article: Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
Recommended article: Q2934593
Recommended article: Polynomial games and determinacy
Recommended article: Integer Programming and Combinatorial Optimization
Recommended article: The complexity of computational problems about Nash equilibria in symmetric win-lose games
Recommended article: The complexity of two-person zero-sum games in extensive form
description: scientific article; zbMATH DE number 58718