Exponential Lower Bounds for Circuit Families (P ≠ NP)

Easy Theory

circuit families complexity theory computational complexity computer science easy theory easy theory complexity exponential lower bounds lower bounds p equals np p not equal np p not equal to np p np proof p vs np theoretical computer science theory of computation

description

Here we prove that P ≠ NP by giving an exponential lower bound for circuit families.

Easy Theory Website: https://www.easytheory.org Discord: https://discord.gg/SD4U3hs

If you like this content, please consider subscribing to my channel: https://www.youtube.com/channel/UC3VY6RTXegnoSD_q446oBdg?sub_confirmation=1

▶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. ... https://www.youtube.com/watch?v=-46HVSXJ8Z0

created

2023-04-01

staked

0.0 LBC

license

Copyrighted (contact publisher)

File size

400886507 Bytes