The Complexity of General-Valued CSPs

FOCS 2015, SIAM Journal on Computing 2016

Authors: Vladimir Kolmogorov, Andrei Krokhin, Michal Rolinek

Somewhat heavy theory. A strong result that concludes complexity classification of a large class of discrete optimization problems.