|
Please note that this page does not hosts or makes available any of the listed filenames. You
cannot download any of those files from here.
|
| [CourseClub.NET].url |
123B |
| [DesireCourse.Com].url |
51B |
| 01__resources.html |
2.02KB |
| 01_2-sat.de.srt |
13.30KB |
| 01_2-sat.de.txt |
8.08KB |
| 01_2-sat.en.srt |
13.29KB |
| 01_2-sat.en.txt |
8.07KB |
| 01_2-sat.et.srt |
13.29KB |
| 01_2-sat.et.txt |
8.07KB |
| 01_2-sat.ja.srt |
13.32KB |
| 01_2-sat.ja.txt |
8.09KB |
| 01_2-sat.ka.srt |
13.29KB |
| 01_2-sat.ka.txt |
8.07KB |
| 01_2-sat.kk.srt |
13.29KB |
| 01_2-sat.kk.txt |
8.07KB |
| 01_2-sat.lt.srt |
13.29KB |
| 01_2-sat.lt.txt |
8.07KB |
| 01_2-sat.mn.srt |
13.29KB |
| 01_2-sat.mn.txt |
8.07KB |
| 01_2-sat.mp4 |
16.66MB |
| 01_2-sat.ne.srt |
13.29KB |
| 01_2-sat.ne.txt |
8.07KB |
| 01_2-sat.ro.srt |
13.53KB |
| 01_2-sat.ro.txt |
8.16KB |
| 01_2-sat.sk.srt |
13.29KB |
| 01_2-sat.sk.txt |
8.07KB |
| 01_2-sat.sq.srt |
13.29KB |
| 01_2-sat.sq.txt |
8.07KB |
| 01_2-sat.sr.srt |
13.29KB |
| 01_2-sat.sr.txt |
8.07KB |
| 01_2-sat.sv.srt |
13.29KB |
| 01_2-sat.sv.txt |
8.07KB |
| 01_2-sat.ta.srt |
13.29KB |
| 01_2-sat.ta.txt |
8.07KB |
| 01_2-sat.te.srt |
13.29KB |
| 01_2-sat.te.txt |
8.07KB |
| 01_2-sat.th.srt |
13.33KB |
| 01_2-sat.th.txt |
8.10KB |
| 01_2-sat.tr.srt |
13.30KB |
| 01_2-sat.tr.txt |
8.07KB |
| 01_3-sat-backtracking.en.srt |
14.43KB |
| 01_3-sat-backtracking.en.txt |
8.96KB |
| 01_3-sat-backtracking.mp4 |
22.26MB |
| 01_available-programming-languages_instructions.html |
4.24KB |
| 01_bipartite-matching_15_flows_8_bipartite_matching.pdf |
674.29KB |
| 01_bipartite-matching.en.srt |
15.97KB |
| 01_bipartite-matching.en.txt |
10.13KB |
| 01_bipartite-matching.mp4 |
17.93MB |
| 01_brute-force-search.en.srt |
7.54KB |
| 01_brute-force-search.en.txt |
4.73KB |
| 01_brute-force-search.mp4 |
11.93MB |
| 01_convexity.en.srt |
12.71KB |
| 01_convexity.en.txt |
8.00KB |
| 01_convexity.mp4 |
14.07MB |
| 01_introduction_15_flows_1_transporting_goods.pdf |
456.35KB |
| 01_introduction.en.srt |
4.90KB |
| 01_introduction.en.srt |
7.54KB |
| 01_introduction.en.srt |
5.79KB |
| 01_introduction.en.srt |
7.41KB |
| 01_introduction.en.txt |
3.19KB |
| 01_introduction.en.txt |
4.67KB |
| 01_introduction.en.txt |
3.64KB |
| 01_introduction.en.txt |
4.70KB |
| 01_introduction.mp4 |
5.50MB |
| 01_introduction.mp4 |
8.16MB |
| 01_introduction.mp4 |
10.13MB |
| 01_introduction.mp4 |
21.14MB |
| 01_introduction.zh-CN.srt |
6.79KB |
| 01_introduction.zh-CN.txt |
3.91KB |
| 01_linear-programming-formulations.en.srt |
13.46KB |
| 01_linear-programming-formulations.en.txt |
8.34KB |
| 01_linear-programming-formulations.mp4 |
13.91MB |
| 01_optional-programming-assignment-5_instructions.html |
1.28KB |
| 01_optional-programming-assignment-5_ProgrammingAssignment5.pdf |
398.59KB |
| 01_optional-programming-assignment-5_starter_files.zip |
1.30KB |
| 01_programming-assignment-2_instructions.html |
1.76KB |
| 01_programming-assignment-2_Programming_Assignment_2.pdf |
922.27KB |
| 01_programming-assignment-2_Programming_Assignment_2.zip |
26.27KB |
| 01_programming-assignment-3_instructions.html |
1.49KB |
| 01_programming-assignment-3_Programming_Assignment_3.pdf |
1.12MB |
| 01_programming-assignment-3_Programming_Assignment_3.zip |
6.12KB |
| 01_programming-assignment-4_instructions.html |
1.47KB |
| 01_programming-assignment-4_Programming_Assignment_4.pdf |
1.55MB |
| 01_programming-assignment-4_Programming_Assignment_4.zip |
10.33KB |
| 01_reductions.en.srt |
5.71KB |
| 01_reductions.en.txt |
3.59KB |
| 01_reductions.mp4 |
13.04MB |
| 01_residual-networks_15_flows_3_residual_networks.pdf |
350.25KB |
| 01_residual-networks.en.srt |
13.79KB |
| 01_residual-networks.en.txt |
8.94KB |
| 01_residual-networks.mp4 |
14.78MB |
| 01 slides-and-resources-on-coping-with-np-completeness 18 coping with np completeness 1 introduction pdf |
119.00KB |
| 01 slides-and-resources-on-coping-with-np-completeness 18 coping with np completeness 2 special cases pdf |
283.40KB |
| 01 slides-and-resources-on-coping-with-np-completeness 18 coping with np completeness 3 exact algorithms pdf |
428.74KB |
| 01 slides-and-resources-on-coping-with-np-completeness 18 coping with np completeness 4 approximation algorithms pdf |
281.82KB |
| 01_slides-and-resources-on-coping-with-np-completeness_instructions.html |
1.93KB |
| 01 slides-and-resources-on-flows-in-networks 15 flows 1 transporting goods pdf |
456.35KB |
| 01_slides-and-resources-on-flows-in-networks_15_flows_2_network_flows.pdf |
410.69KB |
| 01 slides-and-resources-on-flows-in-networks 15 flows 3 residual networks pdf |
350.25KB |
| 01_slides-and-resources-on-flows-in-networks_15_flows_4_maxflow_mincut.pdf |
358.64KB |
| 01_slides-and-resources-on-flows-in-networks_15_flows_5_ford_fulkerson.pdf |
412.95KB |
| 01_slides-and-resources-on-flows-in-networks_15_flows_6_example.pdf |
706.41KB |
| 01_slides-and-resources-on-flows-in-networks_15_flows_7_edmonds_karp.pdf |
655.70KB |
| 01 slides-and-resources-on-flows-in-networks 15 flows 8 bipartite matching pdf |
674.29KB |
| 01 slides-and-resources-on-flows-in-networks 15 flows 9 image segmentation pdf |
255.21KB |
| 01_slides-and-resources-on-flows-in-networks_instructions.html |
2.41KB |
| 01_slides-and-resources-on-linear-programming_16_LP_1_1_introduction.pdf |
158.88KB |
| 01_slides-and-resources-on-linear-programming_16_LP_1_2_LP.pdf |
187.11KB |
| 01_slides-and-resources-on-linear-programming_16_LP_2_1_Substitution.pdf |
130.25KB |
| 01 slides-and-resources-on-linear-programming 16 LP 2 2 GaussianElimination pdf |
178.56KB |
| 01 slides-and-resources-on-linear-programming 16 LP 2 GaussianElimination pdf |
235.85KB |
| 01_slides-and-resources-on-linear-programming_16_LP_3_Convexity.pdf |
322.29KB |
| 01_slides-and-resources-on-linear-programming_16_LP_4_1_Duality.pdf |
203.39KB |
| 01_slides-and-resources-on-linear-programming_16_LP_4_2_DualityProofs.pdf |
219.06KB |
| 01_slides-and-resources-on-linear-programming_16_LP_5_Formulations.pdf |
455.88KB |
| 01_slides-and-resources-on-linear-programming_16_LP_6_simplex.pdf |
257.14KB |
| 01_slides-and-resources-on-linear-programming_16_LP_7_ellipsoid.pdf |
275.27KB |
| 01_slides-and-resources-on-linear-programming_instructions.html |
2.45KB |
| 01 slides-and-resources-on-np-complete-problems 17 np complete problems 1 search problems pdf |
285.84KB |
| 01 slides-and-resources-on-np-complete-problems 17 np complete problems 2 reductions pdf |
307.14KB |
| 01_slides-and-resources-on-np-complete-problems_instructions.html |
1.79KB |
| 01_slides-and-resources-on-np-complete-problems_sudokusolver.py |
2.11KB |
| 01_the-ford-fulkerson-algorithm_15_flows_5_ford_fulkerson.pdf |
412.95KB |
| 01_the-ford-fulkerson-algorithm.de.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.de.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.en.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.en.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.et.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.et.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.ja.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.ja.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.kk.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.kk.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.lt.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.lt.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.mn.srt |
11.37KB |
| 01_the-ford-fulkerson-algorithm.mn.txt |
6.99KB |
| 01_the-ford-fulkerson-algorithm.mp4 |
9.89MB |
| 01_the-ford-fulkerson-algorithm.ne.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.ne.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.ro.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.ro.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.sk.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.sk.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.sq.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.sq.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.sr.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.sr.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.sv.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.sv.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.ta.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.ta.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.te.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.te.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.th.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.th.txt |
6.98KB |
| 01_the-ford-fulkerson-algorithm.tr.srt |
11.36KB |
| 01_the-ford-fulkerson-algorithm.tr.txt |
6.98KB |
| 01_vertex-cover.en.srt |
12.16KB |
| 01_vertex-cover.en.txt |
7.58KB |
| 01_vertex-cover.mp4 |
20.96MB |
| 02_2-sat-algorithm.en.srt |
15.62KB |
| 02_2-sat-algorithm.en.txt |
9.71KB |
| 02_2-sat-algorithm.mp4 |
19.49MB |
| 02_3-sat-local-search.en.srt |
16.37KB |
| 02_3-sat-local-search.en.txt |
10.02KB |
| 02_3-sat-local-search.mp4 |
28.13MB |
| 02_duality.en.srt |
17.76KB |
| 02_duality.en.txt |
11.07KB |
| 02_duality.mp4 |
18.16MB |
| 02_faq-on-programming-assignments_instructions.html |
15.50KB |
| 02_heavy-hitters-problem.en.srt |
10.75KB |
| 02_heavy-hitters-problem.en.txt |
6.86KB |
| 02_heavy-hitters-problem.mp4 |
31.63MB |
| 02_image-segmentation_15_flows_9_image_segmentation.pdf |
255.21KB |
| 02_image-segmentation.en.srt |
10.68KB |
| 02_image-segmentation.en.txt |
6.65KB |
| 02_image-segmentation.mp4 |
10.84MB |
| 02_linear-programming.en.srt |
12.86KB |
| 02_linear-programming.en.txt |
7.98KB |
| 02_linear-programming.mp4 |
12.62MB |
| 02_maxflow-mincut_15_flows_4_maxflow_mincut.pdf |
358.64KB |
| 02_maxflow-mincut.en.srt |
10.99KB |
| 02_maxflow-mincut.en.txt |
6.99KB |
| 02_maxflow-mincut.mp4 |
10.60MB |
| 02_metric-tsp.en.srt |
15.69KB |
| 02_metric-tsp.en.txt |
9.54KB |
| 02_metric-tsp.mp4 |
23.27MB |
| 02_network-flows_15_flows_2_network_flows.pdf |
410.69KB |
| 02_network-flows.de.srt |
13.24KB |
| 02_network-flows.de.txt |
8.53KB |
| 02_network-flows.en.srt |
13.25KB |
| 02_network-flows.en.txt |
8.53KB |
| 02_network-flows.et.srt |
13.25KB |
| 02_network-flows.et.txt |
8.53KB |
| 02_network-flows.ja.srt |
13.26KB |
| 02_network-flows.ja.txt |
8.55KB |
| 02_network-flows.kk.srt |
13.25KB |
| 02_network-flows.kk.txt |
8.53KB |
| 02_network-flows.lt.srt |
13.25KB |
| 02_network-flows.lt.txt |
8.53KB |
| 02_network-flows.mn.srt |
13.25KB |
| 02_network-flows.mn.txt |
8.53KB |
| 02_network-flows.mp4 |
13.86MB |
| 02_network-flows.ne.srt |
13.25KB |
| 02_network-flows.ne.txt |
8.53KB |
| 02_network-flows.ro.srt |
13.24KB |
| 02_network-flows.ro.txt |
8.53KB |
| 02_network-flows.sk.srt |
13.25KB |
| 02_network-flows.sk.txt |
8.54KB |
| 02_network-flows.sq.srt |
13.25KB |
| 02_network-flows.sq.txt |
8.53KB |
| 02_network-flows.sr.srt |
13.25KB |
| 02_network-flows.sr.txt |
8.53KB |
| 02_network-flows.sv.srt |
13.25KB |
| 02_network-flows.sv.txt |
8.53KB |
| 02_network-flows.ta.srt |
13.25KB |
| 02_network-flows.ta.txt |
8.53KB |
| 02_network-flows.te.srt |
13.25KB |
| 02_network-flows.te.txt |
8.53KB |
| 02_network-flows.th.srt |
13.25KB |
| 02_network-flows.th.txt |
8.53KB |
| 02_network-flows.tr.srt |
13.24KB |
| 02_network-flows.tr.txt |
8.52KB |
| 02_search-problems.en.srt |
11.68KB |
| 02_search-problems.en.txt |
7.14KB |
| 02_search-problems.mp4 |
18.35MB |
| 02_showing-np-completeness.en.srt |
7.88KB |
| 02_showing-np-completeness.en.txt |
4.84KB |
| 02_showing-np-completeness.mp4 |
13.23MB |
| 02_slow-example_15_flows_6_example.pdf |
706.41KB |
| 02_slow-example.en.srt |
5.13KB |
| 02_slow-example.en.txt |
3.14KB |
| 02_slow-example.mp4 |
4.82MB |
| 02_the-simplex-algorithm.en.srt |
14.52KB |
| 02_the-simplex-algorithm.en.txt |
9.29KB |
| 02_the-simplex-algorithm.mp4 |
17.14MB |
| 03_independent-sets-in-trees.en.srt |
17.74KB |
| 03_independent-sets-in-trees.en.txt |
11.15KB |
| 03_independent-sets-in-trees.mp4 |
23.66MB |
| 03_independent-set-to-vertex-cover.en.srt |
6.75KB |
| 03_independent-set-to-vertex-cover.en.txt |
4.24KB |
| 03_independent-set-to-vertex-cover.mp4 |
11.86MB |
| 03_linear-algebra-method-of-substitution.en.srt |
7.33KB |
| 03_linear-algebra-method-of-substitution.en.txt |
4.52KB |
| 03_linear-algebra-method-of-substitution.mp4 |
8.70MB |
| 03_optional-duality-proofs.en.srt |
10.47KB |
| 03_optional-duality-proofs.en.txt |
6.61KB |
| 03_optional-duality-proofs.mp4 |
11.50MB |
| 03_optional-the-ellipsoid-algorithm.en.srt |
9.61KB |
| 03_optional-the-ellipsoid-algorithm.en.txt |
6.02KB |
| 03_optional-the-ellipsoid-algorithm.mp4 |
10.37MB |
| 03_programming-assignment-1_instructions.html |
2.14KB |
| 03_programming-assignment-1_Programming_Assignment_1.pdf |
2.86MB |
| 03_programming-assignment-1_Programming_Assignment_1.zip |
285.56KB |
| 03_reduction-1.en.srt |
6.19KB |
| 03_reduction-1.en.txt |
3.84KB |
| 03_reduction-1.mp4 |
18.81MB |
| 03_the-edmonds-karp-algorithm.en.srt |
15.98KB |
| 03_the-edmonds-karp-algorithm.en.txt |
10.08KB |
| 03_the-edmonds-karp-algorithm.mp4 |
17.39MB |
| 03_traveling-salesman-problem.en.srt |
10.48KB |
| 03_traveling-salesman-problem.en.txt |
6.58KB |
| 03_traveling-salesman-problem.mp4 |
14.96MB |
| 03_tsp-dynamic-programming.en.srt |
17.87KB |
| 03_tsp-dynamic-programming.en.txt |
10.90KB |
| 03_tsp-dynamic-programming.et.srt |
17.87KB |
| 03_tsp-dynamic-programming.et.txt |
10.90KB |
| 03_tsp-dynamic-programming.ja.srt |
17.87KB |
| 03_tsp-dynamic-programming.ja.txt |
10.90KB |
| 03_tsp-dynamic-programming.mp4 |
29.29MB |
| 03_tsp-dynamic-programming.ro.srt |
17.88KB |
| 03_tsp-dynamic-programming.ro.txt |
10.91KB |
| 03_tsp-dynamic-programming.sv.srt |
17.87KB |
| 03_tsp-dynamic-programming.sv.txt |
10.90KB |
| 03_tsp-dynamic-programming.ta.srt |
17.87KB |
| 03_tsp-dynamic-programming.ta.txt |
10.90KB |
| 03_tsp-dynamic-programming.te.srt |
17.87KB |
| 03_tsp-dynamic-programming.te.txt |
10.90KB |
| 03_tsp-local-search.en.srt |
8.09KB |
| 03_tsp-local-search.en.txt |
5.21KB |
| 03_tsp-local-search.mp4 |
15.29MB |
| 04_3-sat-to-independent-set.en.srt |
17.98KB |
| 04_3-sat-to-independent-set.en.txt |
11.25KB |
| 04_3-sat-to-independent-set.mp4 |
29.95MB |
| 04_hamiltonian-cycle-problem.en.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.en.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.ka.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.ka.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.lt.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.lt.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.mp4 |
12.72MB |
| 04_hamiltonian-cycle-problem.ro.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.ro.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.sk.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.sk.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.ta.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.ta.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.te.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.te.txt |
6.05KB |
| 04_hamiltonian-cycle-problem.th.srt |
9.77KB |
| 04_hamiltonian-cycle-problem.th.txt |
6.05KB |
| 04_linear-algebra-gaussian-elimination.en.srt |
14.63KB |
| 04_linear-algebra-gaussian-elimination.en.txt |
9.00KB |
| 04_linear-algebra-gaussian-elimination.mp4 |
13.91MB |
| 04_reduction-2.en.srt |
8.93KB |
| 04_reduction-2.en.txt |
5.59KB |
| 04_reduction-2.mp4 |
27.00MB |
| 04_tsp-branch-and-bound.en.srt |
12.11KB |
| 04_tsp-branch-and-bound.en.txt |
7.57KB |
| 04_tsp-branch-and-bound.mp4 |
15.16MB |
| 05_basic-estimate-1.en.srt |
10.86KB |
| 05_basic-estimate-1.en.txt |
6.79KB |
| 05_basic-estimate-1.mp4 |
32.94MB |
| 05_longest-path-problem.en.srt |
2.10KB |
| 05_longest-path-problem.en.txt |
1.34KB |
| 05_longest-path-problem.mp4 |
4.28MB |
| 05_sat-to-3-sat.en.srt |
8.21KB |
| 05_sat-to-3-sat.en.txt |
5.06KB |
| 05_sat-to-3-sat.mp4 |
12.86MB |
| 06_basic-estimate-2.en.srt |
9.74KB |
| 06_basic-estimate-2.en.txt |
6.16KB |
| 06_basic-estimate-2.mp4 |
28.28MB |
| 06_circuit-sat-to-sat.en.srt |
13.63KB |
| 06_circuit-sat-to-sat.en.txt |
8.33KB |
| 06_circuit-sat-to-sat.mp4 |
20.24MB |
| 06_integer-linear-programming-problem.en.srt |
3.88KB |
| 06_integer-linear-programming-problem.en.txt |
2.46KB |
| 06_integer-linear-programming-problem.mp4 |
7.90MB |
| 07_all-of-np-to-circuit-sat.en.srt |
6.32KB |
| 07_all-of-np-to-circuit-sat.en.txt |
3.91KB |
| 07_all-of-np-to-circuit-sat.mp4 |
9.80MB |
| 07_final-algorithm-1.en.srt |
7.34KB |
| 07_final-algorithm-1.en.txt |
4.76KB |
| 07_final-algorithm-1.mp4 |
22.76MB |
| 07_independent-set-problem.en.srt |
4.14KB |
| 07_independent-set-problem.en.txt |
2.59KB |
| 07_independent-set-problem.mp4 |
8.16MB |
| 08_final-algorithm-2.en.srt |
16.52KB |
| 08_final-algorithm-2.en.txt |
10.71KB |
| 08_final-algorithm-2.mp4 |
52.58MB |
| 08_p-and-np.en.srt |
4.85KB |
| 08_p-and-np.en.txt |
3.13KB |
| 08_p-and-np.mp4 |
10.68MB |
| 08_using-sat-solvers.en.srt |
16.82KB |
| 08_using-sat-solvers.en.txt |
10.40KB |
| 08_using-sat-solvers.mp4 |
25.21MB |
| 09_proofs-1.en.srt |
7.96KB |
| 09_proofs-1.en.txt |
5.11KB |
| 09_proofs-1.mp4 |
19.49MB |
| 10_proofs-2.en.srt |
11.67KB |
| 10_proofs-2.en.txt |
7.19KB |
| 10_proofs-2.mp4 |
26.62MB |