Answers are grounded in this paper and cite their sources.
We determine the complexity of several constraint-satisfaction problems using the heuristic algorithm WalkSAT. At large sizes N, the complexity increases exponentially with N in all cases. Perhaps surprisingly, out of all the models studied, the hardest for WalkSAT is the one for which there is a polynomial time algorithm.
No takes yet. Share an insight, caveat, or question.
Guidetti et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: