A Counterexample of the Statement P = NP: Scientific Explanation

By generating a very simple example of unsolvability in polynomial time in a well-known NP-complete problem, it is proven that the classes P and NP do not coincide in this work. A random process is built for a specific NP-complete issue that provides solutions with random numbers. The assumption that a concrete NP-complete problem belongs…
Read more


November 26, 2021 0