A Galois Connection for Valued Constraint Languages of Infinite Size
From MaRDI portal
Publication:3448812
DOI10.1007/978-3-662-47672-7_42zbMath1440.68115OpenAlexW1764221576MaRDI QIDQ3448812
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_42
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Operations and polynomials in algebraic structures, primal algebras (08A40) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (3)
Sherali-Adams Relaxations for Valued CSPs ⋮ On planar valued CSPs ⋮ Binarisation for Valued Constraint Satisfaction Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring, constraint satisfaction, and complexity
- On the complexity of H-coloring
- The complexity of soft constraint satisfaction
- Complexity of conservative constraint satisfaction problems
- The Complexity of Finite-Valued CSPs
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Algebraic Properties of Valued Constraint Satisfaction Problem
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Closure properties of constraints
- The complexity of maximal constraint languages
- The Power of Linear Programming for General-Valued CSPs
- Classifying the Complexity of Constraints Using Finite Algebras
- The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
- An Algebraic Theory of Complexity for Discrete Optimization
- The complexity of satisfiability problems
This page was built for publication: A Galois Connection for Valued Constraint Languages of Infinite Size
