Non recursive functions have transcendental generating series
On the hardness of game equivalence under local isomorphism
We introduce a type of isomorphism among strategic games that we call . Local isomorphisms is a weaker version of the notions of strong and weak game isomorphism introduced in [J. Gabarro, A. Garcia and M. Serna, 412 (2011) 6675–6695]. In a local isomorphism it is required to preserve, for any player, the player’s preferences on the sets of strategy profiles that differ only in the action selected by this player. We show that the game isomorphism problem for local isomorphism is equivalent to the...
Nonuniform complexity classes specified by lower and upper bounds
Page 1