The complexity of finite-valued CSPs

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488697 ◽

2013 ◽

Cited By ~ 15

Author(s):

Johan Thapper ◽

Stanislav Zivny

Download Full-text