The Complexity Of The NP-Class - Computer Science > Computational ComplexityReportar como inadecuado




The Complexity Of The NP-Class - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper presents a novel and straight formulation, and gives a completeinsight towards the understanding of the complexity of the problems of the socalled NP-Class. In particular, this paper focuses in the Searching of theOptimal Geometrical Structures and the Travelling Salesman Problems. The mainresults are the polynomial reduction procedure and the solution to the NotedConjecture of the NP-Class.



Autor: Carlos Barron-Romero

Fuente: https://arxiv.org/







Documentos relacionados