Computer Science – Computational Complexity
Scientific paper
2007-01-04
Computer Science
Computational Complexity
9 pages. The version consolidates results and shares know-how
Scientific paper
Article describes a class of efficient algorithms for 3SAT and their
generalizations on SAT.
No associations
LandOfFree
A Polynomial Time Algorithm for 3-SAT 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 Algorithm for 3-SAT, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polynomial Time Algorithm for 3-SAT will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-310032