2004/06/21 by Bonifac Donat, Donat, Bonifac
Chemistry · Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #History and advancements in chemistry #Logic in Computer Science (cs.LO) #cs.CC #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0406040
openalex publication_date 2004/06/21 · arxiv created 2004/06/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Are P and NP provably inseparable ? Take a look at some unorthodox, guilty mentioned folklore and related unpublished results.