Here we prove that P ≠ NP by giving an exponential lower bound for circuit families.
If you like this content, please consider subscribing to my channel: / @easytheory
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.
The views expressed in this video are not reflective of any of my current or former employers.
Негізгі бет [April Fools] Exponential Lower Bounds for Circuit Families (P ≠ NP)
Пікірлер: 13