Login / Signup

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs

Felix CanavoiErich GrädelRoman Rabinovich
Published in: GandALF (2012)
Keyphrases
  • directed graph
  • learning algorithm
  • optimal solution
  • dynamic programming
  • graph structure
  • objective function
  • convex hull
  • neural network
  • search space
  • np hard
  • undirected graph
  • complexity measures