Vladimir Kolmogorov, Stanislav Zivny. The complexity of conservative valued CSPs. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. pages 750-759, SIAM, 2012. [doi]
@inproceedings{KolmogorovZ12,
title = {The complexity of conservative valued CSPs},
author = {Vladimir Kolmogorov and Stanislav Zivny},
year = {2012},
url = {http://portal.acm.org/citation.cfm?id=2095177&CFID=63838676&CFTOKEN=79617016},
researchr = {https://researchr.org/publication/KolmogorovZ12},
cites = {0},
citedby = {0},
pages = {750-759},
booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012},
editor = {Yuval Rabani},
publisher = {SIAM},
}