The complexity of Boolean surjective general-valued CSPs (ACM Transactions on Computation Theory, 2018)

(untitled) - Fulla, P; Uppman, H; Zivny, S