Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT
Quantum Physics
2013-05-29 v1 Statistical Mechanics
Computational Complexity
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.
Keywords
Cite
@article{arxiv.1102.5152,
title = {Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT},
author = {Marco Guidetti and A. P. Young},
journal= {arXiv preprint arXiv:1102.5152},
year = {2013}
}
Comments
5 pages, 4 figures