• # CCASat

• Referenced in 13 articles [sw12924]
• concerns improving local search algorithms for random $k$-SAT instances with $k>3$. Although ... progress lags far behind on random $k$-SAT instances with $k>3$. This work proposes ... CCAsubscore is very efficient for solving random $k$-SAT instances with $k>3$, and significantly ... smaller $k$, while the subscore notion is not suitable for solving random 3-SAT...