Because Python package dependency resolution is NP-complete, any Boolean satisfiability (SAT) or (0/1 linear) integer programming (IP) problem can be encoded as a package dependency resolution problem ...

Abstract: We revisit pseudo-Boolean Solving via compilation to SAT. We provide an algorithm for solving pseudo-Boolean problems through an incremental translation to SAT that works with any ...

Abstract: Each additional variable doubles the number of function values of a Boolean function. This exponential increase is known as combinational explosion and limits strongly the solvable problems ...

In this paper we detail a classical algorithmic approach to the k-satisfiability (k-SAT) problem that is inspired by the quantum amplitude amplification algorithm. This work falls under the emerging ...

Determining the satisfiability of Boolean constraint-satisfaction problems with different types of constraints, that is hybrid constraints, is a well-studied problem with important applications. We ...