Algebraic "NP vs. P" vs. "Boolean NP vs. P": Graduate Complexity Lecture 15 postscript at CMU

Why it's on BrighterTube

From a channel a BrighterTube curator approved in full · found via Round 4 discovery: listed as a featured channel by Lumen channel(s) Polylog · 85% confidence

From a channel Lumen includes in full: This is a CMU professor's channel of full university course lectures (complexity, quantum computing, Boolean function analysis, TCS toolkit) and research talks. Every sampled transcript is rigorous chalkboard or slide teaching with no entertainment framing. The only outliers are the 4-minute non-academic 'Final Prize Pantry (no quantum)' clip and one short with a clickbait-style title ('The secret GCD method they didn't teach you in school'), and both are caught by title patterns.

What you'll learn

A 14-minute video from Ryan O'Donnell's catalogue; the title names its topic.

Video by Ryan O'Donnell, played through YouTube's embedded player.

Videos are embedded from YouTube and belong to their creators. BrighterTube isn't affiliated with YouTube or Google.

As an Amazon Associate, BrighterTube earns from qualifying purchases.

© 2026 BrighterTube