Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Johan Thapper, Stanislav Zivny. The complexity of finite-valued CSPs. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 695-704, ACM, 2013. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The Complexity of Finite-Valued CSPsJohan Thapper, Stanislav Zivny. JACM, 63(4):37, 2016. [doi]
The following publications are possibly variants of this publication: