|
Обратите внимание, что наш сайт не размещает какие-либо файлы из списка. Вы не можете скачать
эти файлы или скачать torrent-файл.
|
| 0_Final_Exam.html |
31.74Кб |
| 0_Problem_Set_1.html |
143.76Кб |
| 01_A_Greedy_Knapsack_Heuristic_14_min_0_Slides_PDF.pdf |
2.06Мб |
| 01_A_Greedy_Knapsack_Heuristic_14_min.mp4 |
18.74Мб |
| 01_A_Greedy_Knapsack_Heuristic_14_min.pdf |
124.50Кб |
| 01_A_Greedy_Knapsack_Heuristic_14_min.srt |
21.16Кб |
| 01_A_Greedy_Knapsack_Heuristic_14_min.txt |
14.12Кб |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min_0_Slides_PDF.pdf |
209.06Кб |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.mp4 |
18.33Мб |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.pdf |
731.44Кб |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.srt |
31.36Кб |
| 01_About_the_Course_Part_I_Review_-_Optional_17_min.txt |
20.87Кб |
| 01_Application-_Internet_Routing_11_min_0_Slides_PDF.pdf |
1.41Мб |
| 01_Application-_Internet_Routing_11_min.mp4 |
13.85Мб |
| 01_Application-_Internet_Routing_11_min.pdf |
90.85Кб |
| 01_Application-_Internet_Routing_11_min.srt |
17.78Кб |
| 01_Application-_Internet_Routing_11_min.txt |
11.97Кб |
| 01_Application_to_Clustering_12_min_0_Slides_PDF.pdf |
1.79Мб |
| 01_Application_to_Clustering_12_min.mp4 |
15.13Мб |
| 01_Application_to_Clustering_12_min.pdf |
134.01Кб |
| 01_Application_to_Clustering_12_min.srt |
18.49Кб |
| 01_Application_to_Clustering_12_min.txt |
12.28Кб |
| 01_Introduction_and_Motivation_9_min_0_Slides_PDF.pdf |
1.66Мб |
| 01_Introduction_and_Motivation_9_min.mp4 |
11.89Мб |
| 01_Introduction_and_Motivation_9_min.pdf |
99.10Кб |
| 01_Introduction_and_Motivation_9_min.srt |
14.36Кб |
| 01_Introduction_and_Motivation_9_min.txt |
9.55Кб |
| 01_Introduction_to_Greedy_Algorithms_13_min_0_Slides_PDF.pdf |
1.75Мб |
| 01_Introduction_to_Greedy_Algorithms_13_min.mp4 |
18.04Мб |
| 01_Introduction_to_Greedy_Algorithms_13_min.pdf |
91.29Кб |
| 01_Introduction_to_Greedy_Algorithms_13_min.srt |
21.74Кб |
| 01_Introduction_to_Greedy_Algorithms_13_min.txt |
14.49Кб |
| 01 Introduction- Weighted Independent Sets in Path Graphs 8 min 0 Slides PDF pdf |
1.18Мб |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.mp4 |
11.26Мб |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.pdf |
102.09Кб |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.srt |
13.06Кб |
| 01_Introduction-_Weighted_Independent_Sets_in_Path_Graphs_8_min.txt |
8.66Кб |
| 01_Kruskals_MST_Algorithm_8_min_0_Slides_PDF.pdf |
751.67Кб |
| 01_Kruskals_MST_Algorithm_8_min.mp4 |
11.02Мб |
| 01_Kruskals_MST_Algorithm_8_min.pdf |
104.91Кб |
| 01_Kruskals_MST_Algorithm_8_min.srt |
13.30Кб |
| 01_Kruskals_MST_Algorithm_8_min.txt |
8.79Кб |
| 01_Lazy_Unions_Advanced_-_Optional_10_min_0_Slides_PDF.pdf |
1.64Мб |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.mp4 |
15.24Мб |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.pdf |
137.32Кб |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.srt |
16.00Кб |
| 01_Lazy_Unions_Advanced_-_Optional_10_min.txt |
10.67Кб |
| 01_MST_Problem_Definition_11_min_0_Slides_PDF.pdf |
1.61Мб |
| 01_MST_Problem_Definition_11_min.mp4 |
15.00Мб |
| 01_MST_Problem_Definition_11_min.pdf |
117.92Кб |
| 01_MST_Problem_Definition_11_min.srt |
18.16Кб |
| 01_MST_Problem_Definition_11_min.txt |
12.18Кб |
| 01_Optimal_Substructure_14_min_0_Slides_PDF.pdf |
2.36Мб |
| 01_Optimal_Substructure_14_min.mp4 |
19.54Мб |
| 01_Optimal_Substructure_14_min.pdf |
142.34Кб |
| 01_Optimal_Substructure_14_min.srt |
21.10Кб |
| 01_Optimal_Substructure_14_min.txt |
14.06Кб |
| 01_Polynomial-Time_Solvable_Problems_14_min_0_Slides_PDF.pdf |
1.86Мб |
| 01_Polynomial-Time_Solvable_Problems_14_min.mp4 |
20.49Мб |
| 01_Polynomial-Time_Solvable_Problems_14_min.pdf |
124.52Кб |
| 01_Polynomial-Time_Solvable_Problems_14_min.srt |
21.39Кб |
| 01_Polynomial-Time_Solvable_Problems_14_min.txt |
14.35Кб |
| 01_Problem_Definition_12_min_0_Slides_PDF.pdf |
1.94Мб |
| 01_Problem_Definition_12_min.mp4 |
17.19Мб |
| 01_Problem_Definition_12_min.pdf |
161.37Кб |
| 01_Problem_Definition_12_min.srt |
20.18Кб |
| 01_Problem_Definition_12_min.txt |
13.55Кб |
| 01_Problem_Definition_6_min_0_Slides_PDF.pdf |
944.12Кб |
| 01_Problem_Definition_6_min.mp4 |
7.79Мб |
| 01_Problem_Definition_6_min.pdf |
112.19Кб |
| 01_Problem_Definition_6_min.srt |
10.05Кб |
| 01_Problem_Definition_6_min.txt |
6.74Кб |
| 01_Problem_Definition_7_min_0_Slides_PDF.pdf |
1.00Мб |
| 01_Problem_Definition_7_min.mp4 |
9.48Мб |
| 01_Problem_Definition_7_min.pdf |
111.64Кб |
| 01_Problem_Definition_7_min.srt |
11.12Кб |
| 01_Problem_Definition_7_min.txt |
7.40Кб |
| 01_Single-Source_Shortest_Paths_Revisted_11_min_0_Slides_PDF.pdf |
1.82Мб |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.mp4 |
15.15Мб |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.pdf |
118.34Кб |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.srt |
17.50Кб |
| 01_Single-Source_Shortest_Paths_Revisted_11_min.txt |
11.79Кб |
| 01_Stable_Matching_Optional_15_min_0_Slides_PDF.pdf |
5.15Мб |
| 01_Stable_Matching_Optional_15_min.mp4 |
22.55Мб |
| 01_Stable_Matching_Optional_15_min.pdf |
160.65Кб |
| 01_Stable_Matching_Optional_15_min.srt |
19.95Кб |
| 01_Stable_Matching_Optional_15_min.txt |
13.25Кб |
| 01_The_Knapsack_Problem_10_min_0_Slides_PDF.pdf |
1.48Мб |
| 01_The_Knapsack_Problem_10_min.mp4 |
14.08Мб |
| 01_The_Knapsack_Problem_10_min.pdf |
119.46Кб |
| 01_The_Knapsack_Problem_10_min.srt |
14.41Кб |
| 01_The_Knapsack_Problem_10_min.txt |
9.63Кб |
| 01_The_Maximum_Cut_Problem_I_9_min_0_Slides_PDF.pdf |
3.06Мб |
| 01_The_Maximum_Cut_Problem_I_9_min.mp4 |
12.41Мб |
| 01_The_Maximum_Cut_Problem_I_9_min.pdf |
194.58Кб |
| 01_The_Maximum_Cut_Problem_I_9_min.srt |
12.73Кб |
| 01_The_Maximum_Cut_Problem_I_9_min.txt |
8.60Кб |
| 01_The_Vertex_Cover_Problem_9_min_0_Slides_PDF.pdf |
1.20Мб |
| 01_The_Vertex_Cover_Problem_9_min.mp4 |
12.75Мб |
| 01_The_Vertex_Cover_Problem_9_min.pdf |
109.62Кб |
| 01_The_Vertex_Cover_Problem_9_min.srt |
13.38Кб |
| 01_The_Vertex_Cover_Problem_9_min.txt |
8.94Кб |
| 02_A_Dynamic_Programming_Algorithm_10_min_0_Slides_PDF.pdf |
1.42Мб |
| 02_A_Dynamic_Programming_Algorithm_10_min.mp4 |
13.61Мб |
| 02_A_Dynamic_Programming_Algorithm_10_min.pdf |
120.94Кб |
| 02_A_Dynamic_Programming_Algorithm_10_min.srt |
14.83Кб |
| 02_A_Dynamic_Programming_Algorithm_10_min.txt |
9.88Кб |
| 02_A_Dynamic_Programming_Algorithm_12_min_0_Slides_PDF.pdf |
2.25Мб |
| 02_A_Dynamic_Programming_Algorithm_12_min.mp4 |
16.71Мб |
| 02_A_Dynamic_Programming_Algorithm_12_min.pdf |
156.82Кб |
| 02_A_Dynamic_Programming_Algorithm_12_min.srt |
19.11Кб |
| 02_A_Dynamic_Programming_Algorithm_12_min.txt |
12.83Кб |
| 02_A_Greedy_Algorithm_13_min_0_Slides_PDF.pdf |
1.63Мб |
| 02_A_Greedy_Algorithm_13_min.mp4 |
17.16Мб |
| 02_A_Greedy_Algorithm_13_min.pdf |
113.48Кб |
| 02_A_Greedy_Algorithm_13_min.srt |
21.98Кб |
| 02_A_Greedy_Algorithm_13_min.txt |
14.63Кб |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min_0_Slides_PDF.pdf |
2.72Мб |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.mp4 |
8.93Мб |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.pdf |
152.30Кб |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.srt |
10.17Кб |
| 02_Analysis_of_a_Greedy_Knapsack_Heuristic_I_7_min.txt |
6.79Кб |
| 02_Application-_Optimal_Caching_11_min_0_Slides_PDF.pdf |
1.14Мб |
| 02_Application-_Optimal_Caching_11_min.mp4 |
14.97Мб |
| 02_Application-_Optimal_Caching_11_min.pdf |
81.63Кб |
| 02_Application-_Optimal_Caching_11_min.srt |
16.96Кб |
| 02_Application-_Optimal_Caching_11_min.txt |
11.29Кб |
| 02_Application-_Sequence_Alignment_9_min_0_Slides_PDF.pdf |
2.11Мб |
| 02_Application-_Sequence_Alignment_9_min.mp4 |
11.10Мб |
| 02_Application-_Sequence_Alignment_9_min.pdf |
102.40Кб |
| 02_Application-_Sequence_Alignment_9_min.srt |
13.35Кб |
| 02_Application-_Sequence_Alignment_9_min.txt |
8.91Кб |
| 02_Correctness_of_Clustering_Algorithm_10_min_0_Slides_PDF.pdf |
1.62Мб |
| 02_Correctness_of_Clustering_Algorithm_10_min.mp4 |
11.93Мб |
| 02_Correctness_of_Clustering_Algorithm_10_min.pdf |
142.45Кб |
| 02_Correctness_of_Clustering_Algorithm_10_min.srt |
16.36Кб |
| 02_Correctness_of_Clustering_Algorithm_10_min.txt |
10.86Кб |
| 02_Correctness_of_Kruskals_Algorithm_9_min_0_Slides_PDF.pdf |
1.56Мб |
| 02_Correctness_of_Kruskals_Algorithm_9_min.mp4 |
12.30Мб |
| 02_Correctness_of_Kruskals_Algorithm_9_min.pdf |
118.62Кб |
| 02_Correctness_of_Kruskals_Algorithm_9_min.srt |
14.93Кб |
| 02_Correctness_of_Kruskals_Algorithm_9_min.txt |
9.91Кб |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min_0_Slides_PDF.pdf |
5.15Мб |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.mp4 |
20.96Мб |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.pdf |
160.65Кб |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.srt |
19.83Кб |
| 02_Matchings_Flows_and_Braesss_Paradox_Optional_14_min.txt |
13.34Кб |
| 02_Optimal_Substructure_11_min_0_Slides_PDF.pdf |
1.95Мб |
| 02_Optimal_Substructure_11_min.mp4 |
15.27Мб |
| 02_Optimal_Substructure_11_min.pdf |
132.89Кб |
| 02_Optimal_Substructure_11_min.srt |
16.47Кб |
| 02_Optimal_Substructure_11_min.txt |
11.04Кб |
| 02_Optimal_Substructure_12_min_0_Slides_PDF.pdf |
1.87Мб |
| 02_Optimal_Substructure_12_min.mp4 |
16.53Мб |
| 02_Optimal_Substructure_12_min.pdf |
136.74Кб |
| 02_Optimal_Substructure_12_min.srt |
19.76Кб |
| 02_Optimal_Substructure_12_min.txt |
13.13Кб |
| 02_Optimal_Substructure_9_min_0_Slides_PDF.pdf |
3.29Мб |
| 02_Optimal_Substructure_9_min.mp4 |
13.94Мб |
| 02_Optimal_Substructure_9_min.pdf |
172.51Кб |
| 02_Optimal_Substructure_9_min.srt |
15.57Кб |
| 02_Optimal_Substructure_9_min.txt |
10.41Кб |
| 02_Prims_MST_Algorithm_8_min_0_Slides_PDF.pdf |
1.10Мб |
| 02_Prims_MST_Algorithm_8_min.mp4 |
9.99Мб |
| 02_Prims_MST_Algorithm_8_min.pdf |
105.28Кб |
| 02_Prims_MST_Algorithm_8_min.srt |
12.71Кб |
| 02_Prims_MST_Algorithm_8_min.txt |
8.51Кб |
| 02_Problem_Definition_10_min_0_Slides_PDF.pdf |
1.89Мб |
| 02_Problem_Definition_10_min.mp4 |
15.35Мб |
| 02_Problem_Definition_10_min.pdf |
163.75Кб |
| 02_Problem_Definition_10_min.srt |
15.48Кб |
| 02_Problem_Definition_10_min.txt |
10.33Кб |
| 02_Reductions_and_Completeness_14_min_0_Slides_PDF.pdf |
1.75Мб |
| 02_Reductions_and_Completeness_14_min.mp4 |
19.86Мб |
| 02_Reductions_and_Completeness_14_min.pdf |
82.99Кб |
| 02_Reductions_and_Completeness_14_min.srt |
19.92Кб |
| 02_Reductions_and_Completeness_14_min.txt |
13.33Кб |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min_0_Slides_PDF.pdf |
2.69Мб |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.mp4 |
14.14Мб |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.pdf |
151.50Кб |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.srt |
14.07Кб |
| 02_Smarter_Search_for_Vertex_Cover_I_10_min.txt |
9.46Кб |
| 02_The_Maximum_Cut_Problem_II_9_min_0_Slides_PDF.pdf |
3.06Мб |
| 02_The_Maximum_Cut_Problem_II_9_min.mp4 |
12.84Мб |
| 02_The_Maximum_Cut_Problem_II_9_min.pdf |
194.58Кб |
| 02_The_Maximum_Cut_Problem_II_9_min.srt |
14.61Кб |
| 02_The_Maximum_Cut_Problem_II_9_min.txt |
9.86Кб |
| 02_Union-by-Rank_Advanced_-_Optional_12_min_0_Slides_PDF.pdf |
2.12Мб |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.mp4 |
18.19Мб |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.pdf |
151.31Кб |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.srt |
19.68Кб |
| 02_Union-by-Rank_Advanced_-_Optional_12_min.txt |
13.12Кб |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min_0_Slides_PDF.pdf |
1.23Мб |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.mp4 |
20.25Мб |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.pdf |
729.13Кб |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.srt |
29.20Кб |
| 02_Why_Study_Algorithms_Part_I_Review_-_Optional_19_min.txt |
19.49Кб |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min_0_Slides_PDF.pdf |
1.67Мб |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.mp4 |
13.52Мб |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.pdf |
130.46Кб |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.srt |
13.60Кб |
| 02_WIS_in_Path_Graphs-_Optimal_Substructure_9_min.txt |
9.09Кб |
| 03_A_Greedy_Algorithm_17_min_0_Slides_PDF.pdf |
2.68Мб |
| 03_A_Greedy_Algorithm_17_min.mp4 |
24.70Мб |
| 03_A_Greedy_Algorithm_17_min.pdf |
183.61Кб |
| 03_A_Greedy_Algorithm_17_min.srt |
26.41Кб |
| 03_A_Greedy_Algorithm_17_min.txt |
17.56Кб |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min_0_Slides_PDF.pdf |
2.72Мб |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.mp4 |
12.40Мб |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.pdf |
152.30Кб |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.srt |
15.15Кб |
| 03_Analysis_of_a_Greedy_Knapsack_Heuristic_II_10_min.txt |
10.16Кб |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min_0_Slides_PDF.pdf |
2.66Мб |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.mp4 |
22.29Мб |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.pdf |
142.48Кб |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.srt |
22.54Кб |
| 03_Analysis_of_Union-by-Rank_Advanced_-_Optional_15_min.txt |
15.02Кб |
| 03_Correctness_Proof_-_Part_I_7_min_0_Slides_PDF.pdf |
1.33Мб |
| 03_Correctness_Proof_-_Part_I_7_min.mp4 |
9.22Мб |
| 03_Correctness_Proof_-_Part_I_7_min.pdf |
112.13Кб |
| 03_Correctness_Proof_-_Part_I_7_min.srt |
11.62Кб |
| 03_Correctness_Proof_-_Part_I_7_min.txt |
7.80Кб |
| 03_Correctness_Proof_I_16_min_0_Slides_PDF.pdf |
2.46Мб |
| 03_Correctness_Proof_I_16_min.mp4 |
19.02Мб |
| 03_Correctness_Proof_I_16_min.pdf |
144.67Кб |
| 03_Correctness_Proof_I_16_min.srt |
23.57Кб |
| 03_Correctness_Proof_I_16_min.txt |
15.51Кб |
| 03 Definition and Interpretation of NP-Completeness I 11 min 0 Slides PDF pdf |
2.21Мб |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.mp4 |
16.35Мб |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.pdf |
91.20Кб |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.srt |
15.75Кб |
| 03_Definition_and_Interpretation_of_NP-Completeness_I_11_min.txt |
10.59Кб |
| 03_Example_Review_-_Optional_14_min_0_Slides_PDF.pdf |
769.69Кб |
| 03_Example_Review_-_Optional_14_min.mp4 |
24.21Мб |
| 03_Example_Review_-_Optional_14_min.pdf |
139.91Кб |
| 03_Example_Review_-_Optional_14_min.srt |
21.55Кб |
| 03_Example_Review_-_Optional_14_min.txt |
12.91Кб |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min 0 Slides PDF pdf |
1.41Мб |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min mp4 |
18.86Мб |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min pdf |
554.01Кб |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min srt |
25.29Кб |
| 03 Guiding Principles for Analysis of Algorithms Part I Review - Optional 15 min txt |
16.96Кб |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min_0_Slides_PDF.pdf |
3.41Мб |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.mp4 |
12.90Мб |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.pdf |
138.48Кб |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.srt |
15.70Кб |
| 03_Implementing_Kruskals_Algorithm_via_Union-Find_I_9_min.txt |
10.44Кб |
| 03_Linear_Programming_and_Beyond_Optional_11_min_0_Slides_PDF.pdf |
5.15Мб |
| 03_Linear_Programming_and_Beyond_Optional_11_min.mp4 |
16.84Мб |
| 03_Linear_Programming_and_Beyond_Optional_11_min.pdf |
160.65Кб |
| 03_Linear_Programming_and_Beyond_Optional_11_min.srt |
17.10Кб |
| 03_Linear_Programming_and_Beyond_Optional_11_min.txt |
11.46Кб |
| 03_Principles_of_Local_Search_I_9_min_0_Slides_PDF.pdf |
2.66Мб |
| 03_Principles_of_Local_Search_I_9_min.mp4 |
12.22Мб |
| 03_Principles_of_Local_Search_I_9_min.pdf |
110.94Кб |
| 03_Principles_of_Local_Search_I_9_min.srt |
14.45Кб |
| 03_Principles_of_Local_Search_I_9_min.txt |
9.71Кб |
| 03_Proof_of_Optimal_Substructure_7_min_0_Slides_PDF.pdf |
3.29Мб |
| 03_Proof_of_Optimal_Substructure_7_min.mp4 |
9.86Мб |
| 03_Proof_of_Optimal_Substructure_7_min.pdf |
172.51Кб |
| 03_Proof_of_Optimal_Substructure_7_min.srt |
9.71Кб |
| 03_Proof_of_Optimal_Substructure_7_min.txt |
6.53Кб |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min_0_Slides_PDF.pdf |
2.69Мб |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.mp4 |
10.37Мб |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.pdf |
151.50Кб |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.srt |
11.43Кб |
| 03_Smarter_Search_for_Vertex_Cover_II_8_min.txt |
7.71Кб |
| 03_The_Basic_Algorithm_I_9_min_0_Slides_PDF.pdf |
2.30Мб |
| 03_The_Basic_Algorithm_I_9_min.mp4 |
12.11Мб |
| 03_The_Basic_Algorithm_I_9_min.pdf |
189.03Кб |
| 03_The_Basic_Algorithm_I_9_min.srt |
12.52Кб |
| 03_The_Basic_Algorithm_I_9_min.txt |
8.52Кб |
| 03_The_Floyd-Warshall_Algorithm_13_min_0_Slides_PDF.pdf |
1.87Мб |
| 03_The_Floyd-Warshall_Algorithm_13_min.mp4 |
18.89Мб |
| 03_The_Floyd-Warshall_Algorithm_13_min.pdf |
128.02Кб |
| 03_The_Floyd-Warshall_Algorithm_13_min.srt |
21.63Кб |
| 03_The_Floyd-Warshall_Algorithm_13_min.txt |
14.53Кб |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min_0_Slides_PDF.pdf |
1.60Мб |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.mp4 |
14.54Мб |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.pdf |
122.32Кб |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.srt |
15.57Кб |
| 03_WIS_in_Path_Graphs-_A_Linear-Time_Algorithm_10_min.txt |
10.38Кб |
| 04_A_Dynamic_Programming_Algorithm_I_10_min_0_Slides_PDF.pdf |
2.84Мб |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.mp4 |
14.05Мб |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.pdf |
227.07Кб |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.srt |
16.26Кб |
| 04_A_Dynamic_Programming_Algorithm_I_10_min.txt |
10.83Кб |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min_0_Slides_PDF.pdf |
1.66Мб |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.mp4 |
15.41Мб |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.pdf |
106.62Кб |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.srt |
17.54Кб |
| 04_A_Dynamic_Programming_Heuristic_for_Knapsack_12_min.txt |
11.80Кб |
| 04_A_More_Complex_Example_4_min_0_Slides_PDF.pdf |
807.83Кб |
| 04_A_More_Complex_Example_4_min.mp4 |
5.51Мб |
| 04_A_More_Complex_Example_4_min.pdf |
85.91Кб |
| 04_A_More_Complex_Example_4_min.srt |
5.02Кб |
| 04_A_More_Complex_Example_4_min.txt |
3.37Кб |
| 04_A_Reweighting_Technique_14_min_0_Slides_PDF.pdf |
2.43Мб |
| 04_A_Reweighting_Technique_14_min.mp4 |
19.62Мб |
| 04_A_Reweighting_Technique_14_min.pdf |
183.28Кб |
| 04_A_Reweighting_Technique_14_min.srt |
20.57Кб |
| 04_A_Reweighting_Technique_14_min.txt |
13.71Кб |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min_0_Slides_PDF.pdf |
660.31Кб |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.mp4 |
4.36Мб |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.pdf |
812.01Кб |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.srt |
6.71Кб |
| 04_Big-Oh_Notation_Part_I_Review_-_Optional_4_min.txt |
4.47Кб |
| 04_Correctness_Proof_-_Part_II_5_min_0_Slides_PDF.pdf |
950.25Кб |
| 04_Correctness_Proof_-_Part_II_5_min.mp4 |
6.22Мб |
| 04_Correctness_Proof_-_Part_II_5_min.pdf |
111.74Кб |
| 04_Correctness_Proof_-_Part_II_5_min.srt |
6.93Кб |
| 04_Correctness_Proof_-_Part_II_5_min.txt |
4.64Кб |
| 04_Correctness_Proof_II_8_min_0_Slides_PDF.pdf |
1.06Мб |
| 04_Correctness_Proof_II_8_min.mp4 |
10.14Мб |
| 04_Correctness_Proof_II_8_min.pdf |
113.70Кб |
| 04_Correctness_Proof_II_8_min.srt |
12.69Кб |
| 04_Correctness_Proof_II_8_min.txt |
8.43Кб |
| 04 Definition and Interpretation of NP-Completeness II 8 min 0 Slides PDF pdf |
2.21Мб |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.mp4 |
12.18Мб |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.pdf |
91.20Кб |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.srt |
11.65Кб |
| 04_Definition_and_Interpretation_of_NP-Completeness_II_8_min.txt |
7.86Кб |
| 04_Epilogue_1_min.mp4 |
1.79Мб |
| 04_Epilogue_1_min.srt |
1.86Кб |
| 04_Epilogue_1_min.txt |
1.24Кб |
| 04 Implementing Kruskals Algorithm via Union-Find II 14 min 0 Slides PDF pdf |
3.41Мб |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.mp4 |
18.88Мб |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.pdf |
138.48Кб |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.srt |
22.56Кб |
| 04_Implementing_Kruskals_Algorithm_via_Union-Find_II_14_min.txt |
14.91Кб |
| 04_Path_Compression_Advanced_-_Optional_15_min_0_Slides_PDF.pdf |
1.99Мб |
| 04_Path_Compression_Advanced_-_Optional_15_min.mp4 |
21.51Мб |
| 04_Path_Compression_Advanced_-_Optional_15_min.pdf |
141.34Кб |
| 04_Path_Compression_Advanced_-_Optional_15_min.srt |
22.05Кб |
| 04_Path_Compression_Advanced_-_Optional_15_min.txt |
14.67Кб |
| 04_Principles_of_Local_Search_II_10_min_0_Slides_PDF.pdf |
2.66Мб |
| 04_Principles_of_Local_Search_II_10_min.mp4 |
14.49Мб |
| 04_Principles_of_Local_Search_II_10_min.pdf |
110.94Кб |
| 04_Principles_of_Local_Search_II_10_min.srt |
17.70Кб |
| 04_Principles_of_Local_Search_II_10_min.txt |
11.93Кб |
| 04_The_Basic_Algorithm_II_11_min_0_Slides_PDF.pdf |
2.30Мб |
| 04_The_Basic_Algorithm_II_11_min.mp4 |
13.61Мб |
| 04_The_Basic_Algorithm_II_11_min.pdf |
189.03Кб |
| 04_The_Basic_Algorithm_II_11_min.srt |
16.05Кб |
| 04_The_Basic_Algorithm_II_11_min.txt |
10.62Кб |
| 04_The_Traveling_Salesman_Problem_15_min_0_Slides_PDF.pdf |
2.94Мб |
| 04_The_Traveling_Salesman_Problem_15_min.mp4 |
21.00Мб |
| 04_The_Traveling_Salesman_Problem_15_min.pdf |
148.45Кб |
| 04_The_Traveling_Salesman_Problem_15_min.srt |
23.17Кб |
| 04_The_Traveling_Salesman_Problem_15_min.txt |
15.34Кб |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min_0_Slides_PDF.pdf |
1.16Мб |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.mp4 |
9.62Мб |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.pdf |
127.87Кб |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.srt |
10.99Кб |
| 04_WIS_in_Path_Graphs-_A_Reconstruction_Algorithm_7_min.txt |
7.38Кб |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min_0_Slides_PDF.pdf |
2.09Мб |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.mp4 |
17.45Мб |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.pdf |
180.90Кб |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.srt |
18.00Кб |
| 05_A_Dynamic_Programming_Algorithm_for_TSP_12_min.txt |
12.06Кб |
| 05_A_Dynamic_Programming_Algorithm_II_9_min_0_Slides_PDF.pdf |
2.84Мб |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.mp4 |
11.94Мб |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.pdf |
227.07Кб |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.srt |
15.42Кб |
| 05_A_Dynamic_Programming_Algorithm_II_9_min.txt |
10.40Кб |
| 05_Correctness_Proof_I_10_min_0_Slides_PDF.pdf |
3.48Мб |
| 05_Correctness_Proof_I_10_min.mp4 |
13.30Мб |
| 05_Correctness_Proof_I_10_min.pdf |
173.31Кб |
| 05_Correctness_Proof_I_10_min.srt |
15.76Кб |
| 05_Correctness_Proof_I_10_min.txt |
10.50Кб |
| 05_Detecting_Negative_Cycles_9_min_0_Slides_PDF.pdf |
1.20Мб |
| 05_Detecting_Negative_Cycles_9_min.mp4 |
12.78Мб |
| 05_Detecting_Negative_Cycles_9_min.pdf |
130.17Кб |
| 05_Detecting_Negative_Cycles_9_min.srt |
14.35Кб |
| 05_Detecting_Negative_Cycles_9_min.txt |
9.60Кб |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min_0_Slides_PDF.pdf |
1.79Мб |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.mp4 |
14.48Мб |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.pdf |
461.31Кб |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.srt |
23.68Кб |
| 05_Graph_Representations_Part_I_Review_-_Optional_14_min.txt |
15.62Кб |
| 05_Handling_Ties_Advanced_-_Optional_7_min_0_Slides_PDF.pdf |
1.34Мб |
| 05_Handling_Ties_Advanced_-_Optional_7_min.mp4 |
9.65Мб |
| 05_Handling_Ties_Advanced_-_Optional_7_min.pdf |
120.81Кб |
| 05_Handling_Ties_Advanced_-_Optional_7_min.srt |
11.68Кб |
| 05_Handling_Ties_Advanced_-_Optional_7_min.txt |
7.93Кб |
| 05_Johnsons_Algorithm_I_11_min_0_Slides_PDF.pdf |
3.04Мб |
| 05_Johnsons_Algorithm_I_11_min.mp4 |
15.49Мб |
| 05_Johnsons_Algorithm_I_11_min.pdf |
167.30Кб |
| 05_Johnsons_Algorithm_I_11_min.srt |
15.67Кб |
| 05_Johnsons_Algorithm_I_11_min.txt |
10.51Кб |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min_0_Slides_PDF.pdf |
1.44Мб |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.mp4 |
13.22Мб |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.pdf |
144.40Кб |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.srt |
15.50Кб |
| 05_Knapsack_via_Dynamic_Programming_Revisited_10_min.txt |
10.38Кб |
| 05 MSTs- State-of-the-Art and Open Questions Advanced - Optional 9 min 0 Slides PDF pdf |
1.20Мб |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.mp4 |
14.23Мб |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.pdf |
103.83Кб |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.srt |
14.94Кб |
| 05_MSTs-_State-of-the-Art_and_Open_Questions_Advanced_-_Optional_9_min.txt |
9.92Кб |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min 0 Slides PDF pdf |
3.01Мб |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min mp4 |
13.66Мб |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min pdf |
154.56Кб |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min srt |
14.13Кб |
| 05 Path Compression- The Hopcroft-Ullman Analysis I Advanced - Optional 9 min txt |
9.38Кб |
| 05_Principles_of_Dynamic_Programming_8_min_0_Slides_PDF.pdf |
862.10Кб |
| 05_Principles_of_Dynamic_Programming_8_min.mp4 |
12.27Мб |
| 05_Principles_of_Dynamic_Programming_8_min.pdf |
107.16Кб |
| 05_Principles_of_Dynamic_Programming_8_min.srt |
12.35Кб |
| 05_Principles_of_Dynamic_Programming_8_min.txt |
8.26Кб |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min_0_Slides_PDF.pdf |
2.15Мб |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.mp4 |
14.99Мб |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.pdf |
160.08Кб |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.srt |
19.44Кб |
| 05_Proof_of_Cut_Property_Advanced_-_Optional_12_min.txt |
12.78Кб |
| 05_The_2-SAT_Problem_15_min_0_Slides_PDF.pdf |
1.72Мб |
| 05_The_2-SAT_Problem_15_min.mp4 |
19.64Мб |
| 05_The_2-SAT_Problem_15_min.pdf |
121.19Кб |
| 05_The_2-SAT_Problem_15_min.srt |
22.38Кб |
| 05_The_2-SAT_Problem_15_min.txt |
15.00Кб |
| 05_The_P_vs._NP_Question_9_min_0_Slides_PDF.pdf |
1.27Мб |
| 05_The_P_vs._NP_Question_9_min.mp4 |
14.28Мб |
| 05_The_P_vs._NP_Question_9_min.pdf |
92.67Кб |
| 05_The_P_vs._NP_Question_9_min.srt |
13.20Кб |
| 05_The_P_vs._NP_Question_9_min.txt |
8.87Кб |
| 06_A_Space_Optimization_12_min_0_Slides_PDF.pdf |
2.18Мб |
| 06_A_Space_Optimization_12_min.mp4 |
18.34Мб |
| 06_A_Space_Optimization_12_min.pdf |
130.28Кб |
| 06_A_Space_Optimization_12_min.srt |
18.61Кб |
| 06_A_Space_Optimization_12_min.txt |
12.50Кб |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min_0_Slides_PDF.pdf |
1.10Мб |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.mp4 |
19.86Мб |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.pdf |
102.73Кб |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.srt |
20.39Кб |
| 06_Algorithmic_Approaches_to_NP-Complete_Problems_13_min.txt |
13.76Кб |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min_0_Slides_PDF.pdf |
2.06Мб |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.mp4 |
18.70Мб |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.pdf |
138.24Кб |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.srt |
21.33Кб |
| 06_Ananysis_of_Dynamic_Programming_Heuristic_15_min.txt |
14.33Кб |
| 06_Correctness_Proof_II_13_min_0_Slides_PDF.pdf |
3.48Мб |
| 06_Correctness_Proof_II_13_min.mp4 |
16.75Мб |
| 06_Correctness_Proof_II_13_min.pdf |
173.31Кб |
| 06_Correctness_Proof_II_13_min.srt |
20.89Кб |
| 06_Correctness_Proof_II_13_min.txt |
13.85Кб |
| 06_Fast_Implementation_I_15_min_0_Slides_PDF.pdf |
3.30Мб |
| 06_Fast_Implementation_I_15_min.mp4 |
19.66Мб |
| 06_Fast_Implementation_I_15_min.pdf |
139.05Кб |
| 06_Fast_Implementation_I_15_min.srt |
23.47Кб |
| 06_Fast_Implementation_I_15_min.txt |
15.68Кб |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min_0_Slides_PDF.pdf |
2.29Мб |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.mp4 |
24.36Мб |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.pdf |
1.99Мб |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.srt |
40.16Кб |
| 06_Graph_Search_-_Overview_Part_I_Review_-_Optional_23_min.txt |
26.67Кб |
| 06_Johnsons_Algorithm_II_11_min_0_Slides_PDF.pdf |
3.04Мб |
| 06_Johnsons_Algorithm_II_11_min.mp4 |
16.86Мб |
| 06_Johnsons_Algorithm_II_11_min.pdf |
167.30Кб |
| 06_Johnsons_Algorithm_II_11_min.srt |
16.87Кб |
| 06_Johnsons_Algorithm_II_11_min.txt |
11.24Кб |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min 0 Slides PDF pdf |
3.01Мб |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min mp4 |
17.17Мб |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min pdf |
154.56Кб |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min srt |
17.28Кб |
| 06 Path Compression- The Hopcroft-Ullman Analysis II Advanced - Optional 12 min txt |
11.47Кб |
| 06_Random_Walks_on_a_Line_16_min_0_Slides_PDF.pdf |
2.27Мб |
| 06_Random_Walks_on_a_Line_16_min.mp4 |
21.33Мб |
| 06_Random_Walks_on_a_Line_16_min.pdf |
202.14Кб |
| 06_Random_Walks_on_a_Line_16_min.srt |
24.24Кб |
| 06_Random_Walks_on_a_Line_16_min.txt |
16.21Кб |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min_0_Slides_PDF.pdf |
2.47Мб |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.mp4 |
21.62Мб |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.pdf |
142.14Кб |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.srt |
21.49Кб |
| 07_Analysis_of_Papadimitrious_Algorithm_15_min.txt |
14.39Кб |
| 07 Dijkstras Shortest-Path Algorithm Part I Review - Optional 21 min 0 Slides PDF pdf |
2.69Мб |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.mp4 |
21.92Мб |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.pdf |
432.73Кб |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.srt |
33.72Кб |
| 07_Dijkstras_Shortest-Path_Algorithm_Part_I_Review_-_Optional_21_min.txt |
22.41Кб |
| 07_Fast_Implementation_II_10_min_0_Slides_PDF.pdf |
3.30Мб |
| 07_Fast_Implementation_II_10_min.mp4 |
13.17Мб |
| 07_Fast_Implementation_II_10_min.pdf |
139.05Кб |
| 07_Fast_Implementation_II_10_min.srt |
15.29Кб |
| 07_Fast_Implementation_II_10_min.txt |
10.20Кб |
| 07_Internet_Routing_I_Optional_11_min_0_Slides_PDF.pdf |
1.69Мб |
| 07_Internet_Routing_I_Optional_11_min.mp4 |
16.72Мб |
| 07_Internet_Routing_I_Optional_11_min.pdf |
125.22Кб |
| 07_Internet_Routing_I_Optional_11_min.srt |
18.93Кб |
| 07_Internet_Routing_I_Optional_11_min.txt |
12.65Кб |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min_0_Slides_PDF.pdf |
2.46Мб |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.mp4 |
22.64Мб |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.pdf |
160.27Кб |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.srt |
21.75Кб |
| 07_The_Ackermann_Function_Advanced_-_Optional_17_min.txt |
14.41Кб |
| 08 Data Structures- Overview Part I Review - Optional 5 min 0 Slides PDF pdf |
844.40Кб |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.mp4 |
4.89Мб |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.pdf |
192.87Кб |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.srt |
7.55Кб |
| 08_Data_Structures-_Overview_Part_I_Review_-_Optional_5_min.txt |
5.07Кб |
| 08_Internet_Routing_II_Optional_7_min_0_Slides_PDF.pdf |
1.69Мб |
| 08_Internet_Routing_II_Optional_7_min.mp4 |
10.68Мб |
| 08_Internet_Routing_II_Optional_7_min.pdf |
125.22Кб |
| 08_Internet_Routing_II_Optional_7_min.srt |
11.08Кб |
| 08_Internet_Routing_II_Optional_7_min.txt |
7.46Кб |
| 08 Path Compression- Tarjans Analysis I Advanced - Optional 14 min 0 Slides PDF pdf |
3.43Мб |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.mp4 |
20.78Мб |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.pdf |
181.20Кб |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.srt |
21.16Кб |
| 08_Path_Compression-_Tarjans_Analysis_I_Advanced_-_Optional_14_min.txt |
14.23Кб |
| 09 Heaps- Operations and Applications Part I Review - Optional 18 min 0 Slides PDF pdf |
2.11Мб |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.mp4 |
19.49Мб |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.pdf |
220.89Кб |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.srt |
29.94Кб |
| 09_Heaps-_Operations_and_Applications_Part_I_Review_-_Optional_18_min.txt |
19.96Кб |
| 09 Path Compression- Tarjans Analysis II Advanced - Optional 14 min 0 Slides PDF pdf |
3.43Мб |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.mp4 |
19.09Мб |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.pdf |
181.20Кб |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.srt |
19.71Кб |
| 09_Path_Compression-_Tarjans_Analysis_II_Advanced_-_Optional_14_min.txt |
13.22Кб |
| 1_Programming_Assignment_1.html |
42.84Кб |
| 10_Problem_Set_6.html |
101.47Кб |
| 11_Programming_Assignment_6.html |
47.93Кб |
| 2_Problem_Set_2.html |
93.24Кб |
| 2sat1.txt |
1.22Мб |
| 2sat2.txt |
2.65Мб |
| 2sat3.txt |
5.51Мб |
| 2sat4.txt |
8.37Мб |
| 2sat5.txt |
11.23Мб |
| 2sat6.txt |
14.09Мб |
| 3_Programming_Assignment_2.html |
54.82Кб |
| 4_Problem_Set_3.html |
112.46Кб |
| 5_Programming_Assignment_3.html |
41.37Кб |
| 6_Problem_Set_4.html |
103.60Кб |
| 7_Programming_Assignment_4.html |
50.62Кб |
| 8_Problem_Set_5.html |
78.07Кб |
| 9_Programming_Assignment_5.html |
52.59Кб |
| assignment_home.html |
30.72Кб |
| Assignments.html |
98.11Кб |
| clustering_big.txt |
9.35Мб |
| clustering1.txt |
1.48Мб |
| course_home.html |
62.07Кб |
| CourseLogisticsAssessment.html |
35.31Кб |
| DiscussionForums.html |
59.19Кб |
| edges.txt |
27.63Кб |
| entered_login.html |
1.31Мб |
| Final Exam.html |
34.31Кб |
| g1.txt |
497.57Кб |
| g2.txt |
497.73Кб |
| g3.txt |
497.55Кб |
| Home.html |
62.02Кб |
| jobs.txt |
57.03Кб |
| knapsack_big.txt |
24.97Кб |
| knapsack1.txt |
987б |
| large.txt |
13.15Мб |
| links.txt |
1.35Кб |
| links.txt |
1.35Кб |
| links.txt |
1.72Кб |
| links.txt |
1.47Кб |
| links.txt |
1.35Кб |
| links.txt |
1.49Кб |
| links.txt |
1.35Кб |
| links.txt |
1.48Кб |
| links.txt |
1.35Кб |
| links.txt |
1.59Кб |
| links.txt |
1.35Кб |
| links.txt |
1.46Кб |
| links.txt |
1.33Кб |
| links.txt |
1.23Кб |
| links.txt |
1.41Кб |
| links.txt |
2.34Кб |
| links.txt |
1.33Кб |
| links.txt |
1.42Кб |
| links.txt |
1.33Кб |
| Syllabus.html |
38.45Кб |
| TheoryOptionalProblems.html |
87.35Кб |
| Tips.html |
35.97Кб |
| tsp.txt |
552б |
| zip_page.html |
47.93Кб |
| zip_page.html |
42.84Кб |
| zip_page.html |
54.82Кб |
| zip_page.html |
41.37Кб |
| zip_page.html |
50.62Кб |
| zip_page.html |
52.59Кб |