Lower Bound for General Circuits Computing Clique Function
classification
💻 cs.CC
keywords
boundcircuitscliquecomputingfunctiongenerallowerconfirm
read the original abstract
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.