The Complexity of 3SAT_N and the P versus NP Problem

Details The Complexity of 3SAT_N and the P versus NP Problem The Complexity of 3SAT_N and the P versus NP Problem

2011-01-11

arxiv.org/abs/1101.2018v2

Computer Science

Computational Complexity

18 pages

Scientific paper

We will introduce the NP-complete problem 3SAT_N and extend Tovey's results to a classification theorem for this problem. This classification theorem will lead us to generalize the concept of truth assignments for SAT to aggressive truth assignments for 3SAT_N. All these aggressive truth assignments are pseudo-algorithms. We will use algorithms and pseudo-algorithms to study the complexity of 3SAT_N and the P versus NP problem. The main result will be P != NP.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-152895