On the P VS NP Question: A New Proof of Inequality
- 1 Accademia delle Scienze di Torino, Italy
The analysis discussed in this study is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem derives, which is described by a Boolean function of the number n of the clauses of SAT called “core function”. In this study a new proof is presented according which the number of gates of the minimal implementation of core function increases with n exponentially. Since the synthesis of core function is an NP-complete problem, this result can be considered as the proof of the theorem according which P and NP do not coincide.
Copyright: © 2021 Angelo Raffaele Meo. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 113 Views
- 66 Downloads
- 0 Citations
- P-NP Question
- Boolean Functions
- Polynomial or Exponential Increase