A note on some collapse results of valued constraints
type: Item
instance of: scholarly article
title: A note on some collapse results of valued constraints
zbMATH Open document ID: 1214.68377
author: Bruno Zanuttini
author: S. Zivny
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5771255
zbMATH Keywords: valued constraint satisfaction problems
zbMATH Keywords: expressive power
zbMATH Keywords: max-closed constraints
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.018
OpenAlex ID: W2046699448
cites work: Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: An Algebraic Characterisation of Complexity for Valued Constraint
cites work: The complexity of soft constraint satisfaction
cites work: The expressive power of valued constraints: Hierarchies and collapses
cites work: High-order consistency in valued constraint satisfaction
cites work: Complexity classifications of Boolean constraint satisfaction problems
cites work: Q4198056
cites work: Efficient Algorithms for Description Problems over Finite Totally Ordered Domains
cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side
cites work: On the algebraic structure of combinatorial problems
cites work: Tractable constraints on ordered domains
cites work: The approximability of constraint satisfaction problems
cites work: Networks of constraints: Fundamental properties and applications to picture processing
cites work: Q4040221
cites work: Q3184605
cites work: Q4253835
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: The Expressive Power of Binary Submodular Functions
cites work: Classes of submodular constraints expressible by graph cuts
DOI: 10.1016/J.IPL.2009.01.018
description: scientific article; zbMATH DE number 5771255