|
|
|
|
|
Vladimir Gurvich and Mikhail Vyalyi
We study the algorithmic complexity of solving subtraction games in a fixed dimension with a finite difference set. We prove that there exists a game in this class such that solving the game is EXP-complete and requires time 2O(??)
2
O
(
n
)
, where n is...
ver más
|
|
|
|
|