Lower Bound for General Circuits Computing Clique Function
arXiv:1502.04650
Abstract
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
This paper has been withdrawn by the author due to a crucial error in Section 3