Skip to content

What Makes P vs. NP So Hard? (P ≠ EXPTIME, Time Hierarchy, Baker-Gill-Solovay)

22,231 views

About this video

From a channel a BrighterTube curator vetted

From a channel Lumen includes in full: Undefined Behavior explains theoretical computer science (P vs NP, reductions, Big O, Gödel's incompleteness theorems) in rigorous, animated proof-sketch lessons.

Video by Undefined Behavior, played through YouTube's embedded player.

Part of P vs NP