Algorithms for Solving Linear Constraints Over the Set {0, 1}
摘要
The authors present three algorithms for solving linear constraint systems with integer coefficients over the set {0, 1}. The first algorithm has an exponential time complexity estimate, but is parallelizable. The second algorithm finds solutions by reducing the problem of solving the system of constraints to solving a single linear equation. The third algorithm is a parallel combination of the first and second algorithms. The paper also provides experimental results of the implemented algorithms.