CNF Encodings of Cardinality Constraints Based on Comparator Networks

Michał Karpiński

Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to repr…