Login / Signup
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.
Gregory Z. Gutin
Leo van Iersel
Matthias Mnich
Anders Yeo
Published in:
J. Comput. Syst. Sci. (2012)
Keyphrases
</>
constraint satisfaction problems
constraint satisfaction
computational complexity
search space
np complete
constraint propagation
hard constraints
finite domain
objective function
constraint programming
soft constraints
distributed environment
real numbers
constraint solving