2018/02/15 by Angelo Raffaele Meo, Meo, Angelo Raffaele · 2 voices
Computer Science · #cs.CC
paper · pdf · doi:10.48550/arxiv.1802.05484
The analysis discussed in this paper is based on a well-known NP-complete problem which is called satisfiability problem or SAT. From SAT a new NP-complete problem is derived, which is described by a Boolean function called core function. In this paper it is proved that the cost of the minimal implementation of core function increases with n exponentially. Since the synthesis of core function is an NP-complete problem, this result is equivalent to proving that P and NP do not coincide.