The complexity of general-valued constraint satisfaction problems seen from the other side

The complexity of general-valued constraint satisfaction problems seen from the other side

The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand-side structures, the results of Dalmau, Kolaitis, and Vardi [Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, Spri...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak:	Carbonnel, C, Romero, M, Živný, S
Formatua:	Journal article
Hizkuntza:	English
Argitaratua:	Society for Industrial and Applied Mathematics 2022

Antzeko izenburuak

The complexity of general-valued CSPs seen from the other side
nork: Carbonnel, C, et al.
Argitaratua: (2018)

The complexity of valued constraint satisfaction problems
nork: Živný, S
Argitaratua: (2012)

Approximate counting CSP seen from the other side
nork: Bulatov, A, et al.
Argitaratua: (2020)

Approximate counting CSP seen from the other side
nork: Bulatov, A, et al.
Argitaratua: (2019)

The constraint satisfaction problem: complexity and approximability
nork: Krokhin, A, et al.
Argitaratua: (2017)

Binarisation for valued constraint satisfaction problems
nork: Cohen, D, et al.
Argitaratua: (2017)

The complexity and expressive power of valued constraints
nork: Zivny, S
Argitaratua: (2009)

The Complexity and Expressive Power of Valued Constraints
nork: Živný, S
Argitaratua: (2009)

The complexity of valued constraint models
nork: Živný, S, et al.
Argitaratua: (2009)

The Complexity of Valued Constraint Models.
nork: Zivny, S, et al.
Argitaratua: (2009)

The complexity of valued constraint models
nork: Živný, S, et al.
Argitaratua: (2009)

Hybrid tractability of valued constraint problems
nork: Cooper, M, et al.
Argitaratua: (2011)

On the valued constraint satisfaction problem
nork: Fulla, P
Argitaratua: (2018)

Binary constraint satisfaction problems defined by excluded topological minors
nork: Cohen, D, et al.
Argitaratua: (2018)

Variable and value elimination in binary constraint satisfaction via forbidden patterns
nork: Cohen, DA, et al.
Argitaratua: (2015)

Tractable valued constraints
nork: Jeavons, P, et al.
Argitaratua: (2012)

Expressibility of valued constraints
nork: Živný, S, et al.
Argitaratua: (2007)

Tractable Valued Constraints
nork: Jeavons, P, et al.
Argitaratua: (2013)

Optimization problems with side constraints and generalized equilibrium principles
nork: Antonino Maugeri
Argitaratua: (1994-11-01)

The complexity of Boolean surjective general-valued CSPs
nork: Fulla, P, et al.
Argitaratua: (2017)

The complexity of Boolean surjective general-valued CSPs
nork: Fulla, P, et al.
Argitaratua: (2017)

The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
nork: Brakensiek, J, et al.
Argitaratua: (2020)

The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
nork: Manuel Bodirsky, et al.
Argitaratua: (2020-02-01)

Topology and adjunction in promise constraint satisfaction
nork: Krokhin, A, et al.
Argitaratua: (2023)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
nork: Cohen, D, et al.
Argitaratua: (2010)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.
nork: Cohen, D, et al.
Argitaratua: (2011)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
nork: Cohen, D, et al.
Argitaratua: (2011)

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
nork: Cohen, D, et al.
Argitaratua: (2010)

An algebraic theory of complexity for valued constraints: Establishing a Galois connection
nork: Cohen, D, et al.
Argitaratua: (2011)

The complexity of Boolean surjective general-valued CSPs
nork: Fulla, P, et al.
Argitaratua: (2018)

Point-width and max-CSPs
nork: Carbonnel, C, et al.
Argitaratua: (2019)

Point-width and Max-CSPs
nork: Carbonnel, C, et al.
Argitaratua: (2020)

Hybrid tractability of soft constraint problems
nork: Cooper, M, et al.
Argitaratua: (2010)

Hybrid tractability of soft constraint problems
nork: Cooper, M, et al.
Argitaratua: (2010)

A note on some collapse results of valued constraints
nork: Zanuttini, B, et al.
Argitaratua: (2009)

Invariants and Other Structural Properties of Biochemical Models as a Constraint Satisfaction Problem
nork: Soliman Sylvain
Argitaratua: (2012-05-01)

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
nork: Gottlob, G, et al.
Argitaratua: (2005)

The expressive power of valued constraints: hierarchies and collapses
nork: Cohen, D, et al.
Argitaratua: (2015)

The expressive power of valued constraints: Hierarchies and collapses
nork: Cohen, D, et al.
Argitaratua: (2008)

The expressive power of valued constraints: Hierarchies and collapses
nork: Cohen, D, et al.
Argitaratua: (2007)