scientific article; zbMATH DE number 7075868

zbMath1409.68141MaRDI QIDQ4967163

Stanislav Živný, Andrei A. Krokhin, Peter G. Jeavons

Publication date: 3 July 2019

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/266/249

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (11)

A Galois Connection for Valued Constraint Languages of Infinite Size ⋮ Algebraic Properties of Valued Constraint Satisfaction Problem ⋮ Sherali-Adams Relaxations for Valued CSPs ⋮ Necessary Conditions for Tractability of Valued CSPs ⋮ PTAS for Sparse General-valued CSPs ⋮ The Complexity of Valued CSPs ⋮ Backdoor Sets for CSP. ⋮ Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping ⋮ Finding a given number of solutions to a system of fuzzy constraints ⋮ Unnamed Item ⋮ The Power of Linear Programming for General-Valued CSPs

This page was built for publication: