Deidos covenant is an algorithm to find all the solutions to a problem of "Sum of Subsets" that is NP-Complete, was developed by Oscar Riveros [[email protected]] in 2012.

The algorithm out the explicit solution and/or complement, are "quivalents" or complementary.

mkdir build
cd build
cmake -DCMAKE_BUILD_TYPE=Release ..
make

./deidos_covenant instance.txt

The file format is: (use the gen_ssp.py to generate random examples)

python3 gen_ssp.py bits size

SIZE
TARGET
N_1
N_2
...
N_SIZE