Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder.
Per AustrinAleksa StankovicPublished in: APPROX-RANDOM (2019)
Keyphrases
- cardinality constraints
- constraint satisfaction problems
- boolean algebra
- np complete
- entity relationship
- functional dependencies
- search algorithm
- database schema
- constraint satisfaction
- domain knowledge
- integrity constraints
- constraint propagation
- constraint query languages
- dynamic programming
- special case
- search space
- relational databases