Login / Signup

Classic Nintendo Games Are (Computationally) Hard.

Greg AloupisErik D. DemaineAlan GuoGiovanni Viglietta
Published in: FUN (2014)
Keyphrases
  • computationally hard
  • game theory
  • np hard
  • coalition structures
  • nash equilibrium
  • game theoretic
  • image segmentation
  • objective function
  • pairwise
  • probability distribution
  • efficiently computable