A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Solution of the P versus NP Problem based on specific property of clique function
[article]
2020
arXiv
pre-print
Circuit lower bounds are important since it is believed that a super-polynomial circuit lower bound for a problem in NP implies that P!=NP. Razborov has proved superpolynomial lower bounds for monotone circuits by using method of approximation. By extending this approach, researchers have proved exponential lower bounds for the monotone network complexity of several different functions. But until now, no one could prove a non-linear lower bound for the non-monotone complexity of any Boolean
arXiv:1911.00722v2
fatcat:5x2gu7hw2ffr5hanirhz3etwq4