74 citations · 191 across the 6 of their papers we have counts for
Showing cond-mat.stat-mechShow all
3 papers · 1 filter
cond-mat.stat-mech2008★ 38 cited
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
John Ardelius, Lenka Zdeborová
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters correspo…
cond-mat.stat-mech2007★ 6 cited
Clustering of solutions in hard satisfiability problems
John Ardelius, Erik Aurell, Supriya Krishnamurthy
We study the structure of the solution space and behavior of local search methods on random 3-SAT problems close to the SAT/UNSAT transition. Using the overlap measure of similarit…
cond-mat.stat-mech2006★ 67 cited
Behavior of heuristics and state space structure near SAT/UNSAT transition
John Ardelius, Erik Aurell
We study the behavior of ASAT, a heuristic for solving satisfiability problems by stochastic local search near the SAT/UNSAT transition. The heuristic is focused, i.e. only variabl…