19. Complexity

40,473 views

Why it's on BrighterTube

Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-courses · 92% confidence

Teaches complexity classes P, NP, EXP, reductions and NP-completeness at an introductory level. Taught by Erik Demaine, Jason Ku and Justin Solomon from MIT's current 6.006 syllabus, with board work that is easy to follow on video.

What you'll learn

MIT 6.006, lecture 19: Complexity classes P, NP, EXP, reductions and NP-completeness at an introductory level.

Video by MIT OpenCourseWare, played through YouTube's embedded player.

Part of MIT 6.006 Introduction to Algorithms, Spring 2020

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