Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms☆
Under a Creative Commons license
open access
Keywords
Constraint satisfaction problems
Infinite domains
Partition schemes
Lower bounds
Cited by (0)
- ☆
Parts of this article appeared in the proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS-2018).
© 2021 The Authors. Published by Elsevier B.V.