18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial
38,451 views
About this video
Hand-picked by a BrighterTube curator · found via Developer-Y/cs-video-coursesTeaches rod cutting, subset sum and what pseudopolynomial running time means. 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.
MIT 6.006, lecture 18: Rod cutting, subset sum and what pseudopolynomial running time means.
Video by MIT OpenCourseWare, played through YouTube's embedded player.
Part of MIT 6.006 Introduction to Algorithms, Spring 2020
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.