To study the hardness of the generated instance, we use simulated annealing (SA) [1]} as a powerful stochastic optimizer to solve the generated instances of different parameter triplets \(\lbrace n,f,\rho \rbrace \) , and we record the number of sweeps it takes for the solver to find the ground state (see Section REF ). The SA algorithm performs directly on the problem in the original RBM form (see Section REF ). For testing the performance of a general MAX-SAT solver, one can easily convert the problem into the corresponding MAX-2-SAT form.
