Learn More
  • Dániel Marx
  • 48th Annual IEEE Symposium on Foundations of…
  • 2007
It is well-known that constraint satisfaction problems (CSP) can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most k and n is the size of the input. We show that(More)