The Complexity Of The NP-Class

Details The Complexity Of The NP-Class The Complexity Of The NP-Class

2010-06-11

arxiv.org/abs/1006.2218v1

Computer Science

Computational Complexity

Scientific paper

This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal Geometrical Structures and the Travelling Salesman Problems. The main results are the polynomial reduction procedure and the solution to the Noted Conjecture of the NP-Class.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77053