scientific article
From MaRDI portal
Publication:3123646
zbMath0872.90136arXivmath/9503222MaRDI QIDQ3123646
Publication date: 9 March 1997
Full work available at URL: https://arxiv.org/abs/math/9503222
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)
Related Items (8)
Complexity, appeal and challenges of combinatorial games ⋮ Nim with one or two dynamic restrictions ⋮ Adjoining to \((s,t)\)-Wythoff's game its \(P\)-positions as moves ⋮ Games played by Boole and Galois ⋮ Three-rowed CHOMP ⋮ How far can nim in disguise be stretched? ⋮ Adjoining to Wythoff's game its P-positions as moves ⋮ A new heap game
This page was built for publication:
