CSPs with global modular constraints: algorithms and hardness via polynomial representations.
Joshua BrakensiekSivakanth GopiVenkatesan GuruswamiPublished in: STOC (2019)
Keyphrases
- constraint satisfaction
- computational complexity
- worst case
- constraint satisfaction problems
- non binary
- orders of magnitude
- data structure
- constraint problems
- theoretical analysis
- computational cost
- learning algorithm
- optimization problems
- constraint programming
- significant improvement
- phase transition
- graph theory
- computational problems
- constraint graph
- solving constraint satisfaction problems