The complexity of conservative valued CSPs

The complexity of conservative valued CSPs

Show other versions (2)

Bibliographic Details
Main Authors:	Kolmogorov, V, Živný, S
Format:	Report
Published:	2011

Similar Items

The complexity of conservative valued CSPs
by: Kolmogorov, V, et al.
Published: (2013)

The complexity of conservative valued CSPs
by: Kolmogorov, V, et al.
Published: (2012)

The complexity of conservative finite-valued CSPs
by: Kolmogorov, V, et al.
Published: (2010)

The complexity of finite-valued CSPs
by: Thapper, J, et al.
Published: (2016)

The Complexity of Finite-Valued CSPs
by: Thapper, J, et al.
Published: (2013)

The complexity of finite-valued CSPs
by: Thapper, J, et al.
Published: (2013)

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

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

On planar valued CSPs
by: Fulla, P, et al.
Published: (2016)

On planar valued CSPs
by: Fulla, P, et al.
Published: (2017)

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

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

The Power of Linear Programming for Valued CSPs
by: Thapper, J, et al.
Published: (2012)

The power of linear programming for valued CSPs
by: Thapper, J, et al.
Published: (2015)

The power of linear programming for valued CSPs
by: Thapper, J, et al.
Published: (2012)

Sherali-Adams relaxations for valued CSPs
by: Thapper, J, et al.
Published: (2015)

Necessary conditions for tractability of valued CSPs
by: Thapper, J, et al.
Published: (2015)

PTAS for sparse general-valued CSPs
by: Mezei, BF, et al.
Published: (2021)

PTAS for sparse general-valued CSPs
by: Mezei, B, et al.
Published: (2023)

The limits of SDP relaxations for general-valued CSPs
by: Thapper, J, et al.
Published: (2018)

The limits of SDP relaxations for general-valued CSPs
by: Thapper, J, et al.
Published: (2017)

The power of Sherali-Adams relaxations for general-valued CSPs
by: Thapper, J, et al.
Published: (2015)

The power of Sherali-Adams relaxations for general-valued CSPs
by: Thapper, J, et al.
Published: (2017)

Sparsification of binary CSPs
by: Butti, S, et al.
Published: (2020)

Sparsification of Binary CSPs
by: Butti, S, et al.
Published: (2019)

Additive sparsification of CSPs
by: Pelleg, E, et al.
Published: (2021)

Additive sparsification of CSPs
by: Pelleg, E, et al.
Published: (2023)

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

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

Pliability and approximating max-CSPs
by: Romero, M, et al.
Published: (2023)

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
by: Backens, M, et al.
Published: (2019)

Treewidth-pliability and PTAS for Max-CSPs
by: Romero, M, et al.
Published: (2021)

CLAP: A new algorithm for promise CSPs
by: Ciardo, L, et al.
Published: (2023)

On singleton arc consistency for CSPs defined by monotone patterns
by: Carbonnel, C, et al.
Published: (2018)

On singleton arc consistency for CSPs defined by monotone patterns
by: Carbonnel, C, et al.
Published: (2018)

The power of arc consistency for CSPs defined by partially-ordered forbidden patterns
by: Cooper, M, et al.
Published: (2017)

The power of arc consistency for CSPs defined by partially-ordered forbidden patterns
by: Cooper, M, et al.
Published: (2016)

Tractable classes of binary CSPs defined by excluded topological minors
by: Cohen, D, et al.
Published: (2015)

The complexity of counting locally maximal satisfying assignments of Boolean CSPs
by: Goldberg, L, et al.
Published: (2016)

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
by: Kolmogorov, V, et al.
Published: (2010)