All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels
Gregory Z. GutinLeo van IerselMatthias MnichAnders YeoPublished in: CoRR (2010)
Keyphrases
- constraint satisfaction problems
- polynomial kernels
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- search space
- non binary
- support vector machine
- kernel function
- support vector
- np hard
- constraint networks
- arc consistency
- gaussian kernels
- partial constraint satisfaction
- soft constraints
- solving constraint satisfaction problems
- machine learning
- linearly separable
- path consistency
- dynamic programming
- pseudo boolean optimization
- phase transition
- reinforcement learning