scientific article; zbMATH DE number 6930501

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationGalois correspondenceco-clonescounting constraint satisfaction problem

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)

Unnamed Item ⋮ Quantified Constraints in Twenty Seventeen ⋮ Quantitative Logic Reasoning ⋮ Constraint Satisfaction with Counting Quantifiers

This page was built for publication: