All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels

Gregory Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Fingerprint

Dive into the research topics of 'All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels'. Together they form a unique fingerprint.

Keyphrases

INIS

Mathematics