The Complexity Of The NP-Class

TL;DR

This paper introduces a new formulation for NP-class problems, providing insights into their complexity, including polynomial reduction procedures and solutions to longstanding conjectures, with a focus on geometric optimization and TSP.

Contribution

It offers a novel formulation and a complete understanding of NP-class problem complexities, including solving a notable conjecture and developing polynomial reduction methods.

Findings

Polynomial reduction procedure for NP problems

Solution to the NP-class Noted Conjecture

Enhanced understanding of geometric and TSP complexities

Abstract

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.