2007/09/08 by Mikael Franzén, Franzen, Mikael
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Computational Geometry and Mesh Generation #F.1.2 #F.4.1 #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.0709.1207
openalex publication_date 2007/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.