Understanding Efficient Computation: P vs NP 🤔

Here we ask the question about what "efficient" computation should be, as well as give definitions of P (deterministic polynomial time) and NP (nondeterministic polynomial time).

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

▶SEND ME THEORY QUESTIONS◀
ryan.e.dougherty@icloud.com

▶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.