Publication:4583809

zbMath1394.08009arXiv1210.3344MaRDI QIDQ4583809

Andrei A. Bulatov, Amir Hedayaty

Publication date: 3 September 2018

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

zbMATH Keywords

approximation; Galois correspondence; co-clones; counting constraint satisfaction problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

08A70: Applications of universal algebra in computer science

08A40: Operations and polynomials in algebraic structures, primal algebras

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

Constraint Satisfaction with Counting Quantifiers