The 3-satisfiability problem

Details The 3-satisfiability problem The 3-satisfiability problem

2011-04-22

arxiv.org/abs/1104.4490v2

Computer Science

Computational Complexity

This paper is withdrawn by the author because a revision has been developed

Scientific paper

We present a deterministic polynomial-time algorithm that solves the
3-satisfiability problem.

Affiliated with

Also associated with

No associations

Rating

The 3-satisfiability problem 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 The 3-satisfiability problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The 3-satisfiability problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331075