A polynomial time (heuristic) SAT algorithm

Details A polynomial time (heuristic) SAT algorithm A polynomial time (heuristic) SAT algorithm

2002-05-24

arxiv.org/abs/cs/0205064v3

Computer Science

Computational Complexity

27 pages, 4 figures. Addendum for hole found respective a path inconsistency

Scientific paper

A hole has been found in the algorithm as given, where an eleventh hour
change admits a path inconsistency. The inconsistency arises due to an improper
closure of a path to a cycle against a root not supportive of the path. The
mathematical basis of the algorithm remains supportive of the intended
solution, and a revision of the algorithm is underway.

Affiliated with

Also associated with

No associations

Rating

A polynomial time (heuristic) SAT algorithm 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 A polynomial time (heuristic) SAT algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A polynomial time (heuristic) SAT algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361400