A Galois Connection for Weighted (Relational) Clones of Infinite Size

DOI10.1145/2898438zbMath1427.68120arXiv1502.05086OpenAlexW2294241597MaRDI QIDQ4973854

Peter Fulla, Stanislav Živný

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.05086

zbMATH Keywords

Galois connectionuniversal algebravalued constraint satisfaction problemsdiscrete optimisationweighted polymorphisms

Mathematics Subject Classification ID

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 (4)

The Complexity of General-Valued CSPs ⋮ An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains ⋮ The Power of Sherali--Adams Relaxations for General-Valued CSPs ⋮ The Complexity of Valued CSPs

This page was built for publication: A Galois Connection for Weighted (Relational) Clones of Infinite Size