Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations.
Joshua BrakensiekSivakanth GopiVenkatesan GuruswamiPublished in: SIAM J. Comput. (2022)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- combinatorial problems
- non binary
- constraint graph
- constraint optimization
- np complete
- graph based representations
- constraint solver
- pseudo boolean optimization
- arc consistency algorithm
- soft constraints
- backtracking search
- solving constraint satisfaction problems
- computational complexity
- computational problems
- binary constraints
- decomposition methods
- constraint solving
- constraint problems
- backtracking algorithm
- np hard
- worst case
- tractable classes
- constraint networks
- constraint solvers
- finite domain
- graph theory
- forward checking
- path consistency
- constraint propagation
- arc consistency
- global constraints
- random instances
- search space
- special case
- finding optimal solutions
- tractable subclasses
- disjunctive temporal
- lower bound
- optimization problems
- configuration problems
- space complexity
- hard constraints