Nonuniform Boolean constraint satisfaction problems with cardinality constraint

DOI10.1145/1805950.1805954MaRDI QIDQ2946612zbMATH OpenOpenAlexFDO

Authors 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 complexityconstraint satisfaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Applications of universal algebra in computer science (08A70)

Recommendations

• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
• Algorithms and Computation
• Computational Complexity of Constraint Satisfaction
• The complexity of global cardinality constraints
• A Dichotomy Theorem for Typed Constraint Satisfaction Problems

Cited in

(4)

• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
• Complexity of approximating CSP with balance/hard constraints
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
• Enumerating all solutions of a Boolean CSP by non-decreasing weight

This page was built for publication: Nonuniform Boolean constraint satisfaction problems with cardinality constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946612)