The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P

Details The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P

2010-12-30

arxiv.org/abs/1101.0160v1

Computer Science

Data Structures and Algorithms

Scientific paper

This paper presents the differences between two NP problems. It focuses in
the Euclidian 2 Dimension Travelling Salesman Problems and General Assign
Problems. The main results are the triangle reduction to verify the solution in
polynomial time for the former and for the later the solution to the Noted
Conjecture of the NP-Class, NP is not P.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295056