Login / Signup
On the Empirical Time Complexity of Random 3-SAT at the Phase Transition.
Zongxu Mu
Holger H. Hoos
Published in:
IJCAI (2015)
Keyphrases
</>
phase transition
random sat
satisfiability problem
constraint satisfaction
sat problem
combinatorial problems
random instances
random constraint satisfaction problems
np complete
randomly generated
graph coloring
hard problems
np complete problems
max sat
stochastic local search
knowledge representation