Lower Bound for General Circuits Computing Clique Function
Computational Complexity
2015-02-23 v2
Abstract
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
Cite
@article{arxiv.1502.04650,
title = {Lower Bound for General Circuits Computing Clique Function},
author = {Weimin Chen},
journal= {arXiv preprint arXiv:1502.04650},
year = {2015}
}
Comments
This paper has been withdrawn by the author due to a crucial error in Section 3