Login / Signup

Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361).

Vasco BrattkaDamir D. DzhafarovAlberto MarconeArno Pauly
Published in: Dagstuhl Reports (2018)
Keyphrases
  • combinatorial problems
  • metaheuristic
  • constraint satisfaction
  • combinatorial optimization
  • neural network
  • worst case
  • complexity analysis