The complexity of finite-valued CSPs

DOI10.1145/2488608.2488697MaRDI QIDQ6829225zbMATH OpenFDO

Authors Johan Thapper, S. Zivny

Publication date 7 August 2014

Published in Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:e905dfc2-2e55-45a5-b24f-a5cd98d48743

zbMATH Keywords

complexitydichotomydiscrete optimizationfinite-valued constraint satisfaction problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(3)

• The complexity of resilience problems via valued constraint satisfaction problems
• Temporal valued constraint satisfaction problems
• The complexity of resilience problems via valued constraint satisfaction

This page was built for publication: The complexity of finite-valued CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829225)