Two new homomorphism dualities and lattice operations

DOI10.1093/logcom/exq030zbMath1231.68121OpenAlexW2172286136MaRDI QIDQ3103979

Victor Dalmau, Catarina A. Carvalho, Andrei A. Krokhin

Publication date: 19 December 2011

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exq030

zbMATH Keywords

constraint satisfaction problemDatalogpolymorphismshomomorphism dualitylattice operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Structure theory of lattices (06B05)

Related Items (5)

Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Surjective polymorphisms of directed reflexive cycles ⋮ Semilattice polymorphisms and chordal graphs ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs

This page was built for publication: Two new homomorphism dualities and lattice operations