Login / Signup
Robust algorithms with polynomial loss for near-unanimity CSPs.
Víctor Dalmau
Marcin Kozik
Andrei A. Krokhin
Konstantin Makarychev
Yury Makarychev
Jakub Oprsal
Published in:
CoRR (2016)
Keyphrases
</>
constraint satisfaction problems
decomposition methods
constraint propagation
search space
learning algorithm
computationally efficient
data sets
bayesian networks
significant improvement
graph theory
parameter tuning
constraint graph