2000 character limit reached
Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT
Published 25 Feb 2011 in quant-ph, cond-mat.stat-mech, and cs.CC | (1102.5152v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.