Skip to main content

2 Result(s)

within Conference Paper Remove this filter Alexander Ivrii Remove this filter Algorithm Analysis and Problem Complexity Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Perfect Hashing and CNF Encodings of Cardinality Constraints

    We study the problem of encoding cardinality constraints (threshold functions) on Boolean variables into CNF. Specifically, we propose new encodings based on (perfect) hashing that are efficient in terms of th...

    Yael Ben-Haim, Alexander Ivrii… in Theory and Applications of Satisfiability … (2012)

  2. No Access

    Chapter and Conference Paper

    On Efficient Computation of Variable MUSes

    In this paper we address the following problem: given an unsatisfiable CNF formula \({\mathcal{F}}\) , find a minimal su...

    Anton Belov, Alexander Ivrii, Arie Matsliah… in Theory and Applications of Satisfiability … (2012)