Complexities of winning strategies in diophantine games

DOI10.1006/jcom.1995.1022zbMath0844.90141OpenAlexW2006889582MaRDI QIDQ1908042

Yanyan Li

Publication date: 2 September 1996

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1995.1022

zbMATH Keywords

polynomial time computable winning strategycomputing winning strategies in diophantine games

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05) Combinatorial games (91A46)

Related Items (3)

Complexity, appeal and challenges of combinatorial games ⋮ Epidemiography. II: Games with a dozing yet winning player ⋮ Modular Nim

This page was built for publication: Complexities of winning strategies in diophantine games