CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations.
Joshua BrakensiekSivakanth GopiVenkatesan GuruswamiPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- computational complexity
- learning algorithm
- constraint satisfaction
- constraint networks
- non binary
- worst case
- data structure
- learning theory
- orders of magnitude
- constraint satisfaction problems
- theoretical analysis
- computationally efficient
- significant improvement
- search space
- combinatorial optimization
- computational cost
- decomposition methods