Nonuniform Boolean constraint satisfaction problems with cardinality constraint
From MaRDI portal
Publication:2946612
DOI10.1145/1805950.1805954zbMath1351.68114OpenAlexW2061768978MaRDI QIDQ2946612
Ilka Schnoor, Henning Schnoor, Nadia Creignou
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1805950.1805954
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items
Complexity of approximating CSP with balance/hard constraints ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations