@article {10.3844/jcssp.2021.511.524,
article_type = {journal},
title = {On the P VS NP Question: A New Proof of Inequality},
author = {Meo, Angelo Raffaele},
volume = {17},
number = {5},
year = {2021},
month = {May},
pages = {511-524},
doi = {10.3844/jcssp.2021.511.524},
url = {https://thescipub.com/abstract/jcssp.2021.511.524},
abstract = {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.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}