An Algebraic Characterisation of Complexity for Valued Constraint
From MaRDI portal
Publication:3524237
DOI10.1007/11889205_10zbMath1160.68540OpenAlexW2168016267MaRDI QIDQ3524237
Martin C. Cooper, Peter G. Jeavons, David A. Cohen
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11889205_10
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
The Complexity of General-Valued CSPs ⋮ The Expressive Power of Binary Submodular Functions ⋮ Classes of submodular constraints expressible by graph cuts ⋮ The Expressive Power of Valued Constraints: Hierarchies and Collapses ⋮ Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms ⋮ The expressive power of binary submodular functions ⋮ A note on some collapse results of valued constraints ⋮ Minimization of locally defined submodular functions by optimal soft arc consistency ⋮ Soft Constraints Processing over Divisible Residuated Lattices ⋮ Introduction to the Maximum Solution Problem ⋮ The Power of Linear Programming for General-Valued CSPs
This page was built for publication: An Algebraic Characterisation of Complexity for Valued Constraint
