Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT

Details Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT

2011-02-25

arxiv.org/abs/1102.5152v1

Physics

Quantum Physics

5 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709340