The following publications are possibly variants of this publication:
- The complexity of conservative valued CSPsVladimir Kolmogorov, Stanislav Zivny. JACM, 60(2):10, 2013. [doi]
- The complexity of finite-valued CSPsJohan Thapper, Stanislav Zivny. stoc 2013: 695-704 [doi]
- The Complexity of Finite-Valued CSPsJohan Thapper, Stanislav Zivny. JACM, 63(4):37, 2016. [doi]
- The Complexity of Valued CSPsAndrei A. Krokhin, Stanislav Zivny. In Andrei A. Krokhin, Stanislav Zivny, editors, The Constraint Satisfaction Problem: Complexity and Approximability. Volume 7 of Dagstuhl Follow-Ups, pages 233-266, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
- The Complexity of General-Valued CSPsVladimir Kolmogorov, Andrei A. Krokhin, Michal Rolinek. focs 2015: 1246-1258 [doi]
- The Complexity of General-Valued CSPsVladimir Kolmogorov, Andrei A. Krokhin, Michal RolĂnek. SICOMP, 46(3):1087-1110, 2017. [doi]