Algebraic Properties of Valued Constraint Satisfaction Problem

The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP 2005].

Paper

References (31)

Scroll for more · 19 remaining

Similar papers

© 2026 NYSGPT2525 LLC