Fig. 2From: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functionsDecomposition sets found by PDSAT for cryptanalysis of A5/1. a \(S_2\): found by simulated annealing. b \(S_3\): found by tabu searchBack to article page