The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
From MaRDI portal
Publication:5326612
DOI10.1007/978-3-642-39206-1_68zbMath1336.68148OpenAlexW108355652MaRDI QIDQ5326612
Publication date: 6 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_68
Related Items
The Complexity of General-Valued CSPs ⋮ A Galois Connection for Valued Constraint Languages of Infinite Size ⋮ Sherali-Adams Relaxations for Valued CSPs ⋮ Necessary Conditions for Tractability of Valued CSPs ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ Binarisation for Valued Constraint Satisfaction Problems ⋮ The Complexity of Valued CSPs ⋮ Unnamed Item ⋮ The Power of Linear Programming for General-Valued CSPs
This page was built for publication: The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
