Login / Signup

Classic Nintendo games are (computationally) hard.

Greg AloupisErik D. DemaineAlan GuoGiovanni Viglietta
Published in: Theor. Comput. Sci. (2015)
Keyphrases
  • computationally hard
  • game theory
  • coalition structures
  • efficiently computable
  • np hard
  • cooperative
  • nash equilibrium
  • game theoretic
  • evolutionary algorithm
  • dynamic programming