Login / Signup

Graphs, polymorphisms and the complexity of homomorphism problems.

Libor BartoMarcin KozikTodd Niven
Published in: STOC (2008)
Keyphrases
  • optimization problems
  • np complete
  • decision problems
  • polynomial time complexity
  • solving problems
  • database
  • data sets
  • neural network
  • machine learning
  • benchmark problems
  • graph theory
  • np hardness
  • bounded treewidth