An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

DOI10.1007/978-3-642-22993-0_23zbMath1343.68106OpenAlexW2161880689MaRDI QIDQ3088042

Páidí Creed, Stanislav Živný, Peter G. Jeavons, David A. Cohen

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (3)

On the definition of suitable orderings to generate adjunctions over an unstructured codomain ⋮ Generating Isotone Galois Connections on an Unstructured Codomain ⋮ The Power of Linear Programming for General-Valued CSPs

This page was built for publication: An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection