Finite-Size Scaling in Random $K$-SAT Problems

We propose a comprehensive view of threshold behaviors in random $K$-satisfiability ($K$-SAT) problems, in the context of the finite-size scaling (FSS) concept of nonequilibrium absorbing phase transitions using the average SAT (ASAT) algorithm. In particular, we focus on the value of the FSS exponent to characterize the SAT/UNSAT phase transition, which is still debatable. We also discuss the role of the noise (temperature-like) parameter in stochastic local heuristic search algorithms.