Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey.
Miguel CouceiroLucien HaddadVictor LagerkvistPublished in: ISMVL (2019)
Keyphrases
- fine grained
- constraint satisfaction problems
- constraint satisfaction
- coarse grained
- constraint propagation
- constraint programming
- access control
- np complete
- arc consistency
- search space
- np hard
- non binary
- combinatorial problems
- partial assignment
- computational complexity
- constraint networks
- constraint solving
- worst case
- decision problems
- decomposition methods
- pseudo boolean optimization
- partial constraint satisfaction
- constraint problems
- computational problems
- soft constraints
- global constraints
- temporal constraints
- forward checking
- data model
- dynamic constraint satisfaction problems
- phase transition