From: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions
Source
N
Time estimation
From Eibach et al. (2008)
\(10^{2}\)
\(1.637\times 10^{13}\)
From Soos et al. (2009), Soos (2010)
\(10^{3}\)
\(9.718\times 10^{10}\)
Found by PDSAT
\(10^{5}\)
\(3.769\times 10^{10}\)
