Lower Bound for General Circuits Computing Clique Function

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.