A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms.
Miguel CouceiroLucien HaddadVictor LagerkvistPublished in: J. Multiple Valued Log. Soft Comput. (2022)
Keyphrases
- fine grained
- constraint satisfaction problems
- constraint satisfaction
- coarse grained
- constraint propagation
- np complete
- constraint programming
- computational complexity
- combinatorial problems
- partial assignment
- search space
- non binary
- np hard
- access control
- arc consistency
- constraint networks
- constraint solving
- computational problems
- space complexity
- partial constraint satisfaction
- constraint problems
- worst case
- probabilistic model
- path consistency
- soft constraints
- decomposition methods
- sat problem
- data lineage
- decision problems
- maintaining arc consistency
- constraint solver
- forward checking
- solving constraint satisfaction problems
- global constraints