Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Report
Data sources: ZENODO
Zenodo
Claim

A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP

descriptionPublicationkeyboard_double_arrow_right Report Under curationPublisher:Zenodo
Authors: Lee, Dorival;

doi: 10.5281/zenodo.20628451

A Proof on the Computational Complexity of the Traveling Salesman Problem: Why P ≠ NP

Abstract

This paper presents a formal information-theoretic and logical proof demonstrating that the Traveling Salesman Problem (TSP) cannot be solved in polynomial time.

Powered by OpenAIRE graph
Found an issue? Give us feedback