出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：We designed and implemented an efficient tough random symmetric 3-SAT generator. We
quantify the hardness in terms of CPU time, numbers of restarts, decisions, propagations,
conflicts and conflicted literals that occur when a solver tries to solve 3-SAT instances. In this
experiment, the clause variable ratio was chosen to be around the conventional critical phase
transition number 4.24. The experiment shows that instances generated by our generator are
significantly harder than instances generated by the Tough K-SAT generator. The difference in
hardness between two SAT instance generators exponentiates as the number of Boolean
variables used increases.
