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