Q3984859
type: Item
instance of: scholarly article
zbMATH Open document ID: 0737.90075
publication date: 1992-06-27T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 29719
zbMATH Keywords: computation of winning strategies
MaRDI profile type: Publication
Recommended article: Q3362311
Recommended article: Computational complexity of winning strategies in two-person polynomial games
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: Integer Programming and Combinatorial Optimization
Recommended article: Polynomial games and determinacy
Recommended article: Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game
Recommended article: Q2934593
Recommended article: The complexity of computational problems about Nash equilibria in symmetric win-lose games
Recommended article: Polynomial time algorithm for solving cyclic games
description: scientific article; zbMATH DE number 29719