R21. Dynamic Programming: Knapsack Problem R21. Dynamic Programming: Knapsack Problem begin-post-stats MIT OpenCourseWare • 122K views end-post-stats begin-duration 1:09:12 end-duration Math topics: _Sorting_algorithms_##Sorting algorithms##_Radix_sort_##Radix sort##_Counting_sort_##Counting sort##_Topological_sorting_##Topological sorting##_Graph_theory_##Graph theory##_Graph_theory_##Graph theory##_Graph_(discrete_mathematics)_##Graph (discrete mathematics)##_Vertex_(graph_theory)_##Vertex (graph theory)##_Algebra_##Algebra##_Dimension_##Dimension##_Number_##Number##_Polynomial_##Polynomial##_Set_theory_##Set theory##_Empty_set_##Empty set##_Cardinality_##Cardinality##_Subset_##Subset Other topics: _Computational_complexity_theory_##Computational complexity theory##_Pseudo-polynomial_time_##Pseudo-polynomial time##_Analysis_of_algorithms_##Analysis of algorithms##_Time_complexity_##Time complexity##_Data_unit_##Data unit##_64-bit_computing_##64-bit computing##_Word_(computer_architecture)_##Word (computer architecture)##_32-bit_##32-bit video-id: wFP5VHGHFdk channel_MIT_OpenCourseWare_ So What Learning Algebra , Computational complexity theory , Data unit , Graph theory , Set theory , Sorting algorithms Saturday, January 20, 2018 Share Share
