From: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
Set
Power of set
\(F\left( \cdot \right)\)
\(S_1\)
31
4.45140e+08
\(S_2\)
4.78318e+08
\(S_3\)
32
4.64428e+08