Login / Signup
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder.
Per Austrin
Aleksa Stankovic
Published in:
CoRR (2019)
Keyphrases
</>
cardinality constraints
constraint satisfaction problems
np complete
boolean algebra
functional dependencies
constraint query languages
np hard
search space
constraint satisfaction
deductive databases
database
relational databases
special case
domain specific
inference rules
arc consistency