3 citations · 6 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2016★ 1 cited
Should Algorithms for Random SAT and Max-SAT be Different?
Sixue Liu, Gerard de Melo
We analyze to what extent the random SAT and Max-SAT problems differ in their properties. Our findings suggest that for random -CNF with ratio in a certain range, Max-SAT can be…
cs.AI2015★ 1 cited
An Efficient Implementation for WalkSAT
Sixue Liu
Stochastic local search (SLS) algorithms have exhibited great effectiveness in finding models of random instances of the Boolean satisfiability problem (SAT). As one of the most wi…