← Learning
Learning1:26:03
Advanced Algorithms (COMPSCI 224), Lecture 24
From the creator
More efficient exponential-time algorithms: exponential divide-and-conquer (TSP), pruned brute force (3-SAT), Schöning's algorithm (3-SAT), inclusion-exclusion (k-colorability).
Published 2016-07-11 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.
Keep exploring Learning
45:25LearningEnglish with Lucy
58:58LearningThe Royal Institution
04:59LearningTED-Ed
33:29LearningCrashCourse
29:29LearningBBC Learning English
06:07LearningBBC Learning English
47:40LearningYaleCourses