Nonuniform Boolean constraint satisfaction problems with cardinality constraint

DOI10.1145/1805950.1805954zbMath1351.68114MaRDI QIDQ2946612

Nadia Creignou, Henning Schnoor, Ilka Schnoor

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

zbMATH Keywords

computational complexity; constraint satisfaction

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

08A70: Applications of universal algebra in computer science

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

Related Items

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight