Lower Bound for General Circuits Computing Clique Function

Abstract

We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.