Lower Bound for General Circuits Computing Clique Function
Weimin Chen
TL;DR
This paper establishes an exponential lower bound for general circuits computing the clique function, providing evidence that NP does not equal P, which is a major open problem in computational complexity.
Contribution
It presents the first exponential lower bound for general circuits computing the clique function, advancing understanding of circuit complexity and NP vs P.
Findings
Proves exponential lower bound for clique function circuits
Supports NP != P hypothesis
Advances circuit complexity theory
Abstract
We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Computability, Logic, AI Algorithms · Cryptography and Data Security