magnet:?xt=urn:btih:06FA46812609A2F6818C3E8B098D10A2C23584A8
05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.mp4 55.1 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.mp4 34.5 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.mp4 33.2 MB03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.mp4 31.4 MB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.mp4 30.7 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.mp4 29.7 MB04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.mp4 29.5 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.mp4 28.3 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.mp4 27.9 MB03_np-complete-problems/03_reductions/08_using-sat-solvers.mp4 26.4 MB04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.mp4 24.8 MB04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.mp4 24.4 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.mp4 23.9 MB04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.mp4 23.3 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.mp4 22.2 MB04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.mp4 22.0 MB03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.mp4 21.2 MB04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.mp4 20.4 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.mp4 20.4 MB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.mp4 19.7 MB03_np-complete-problems/02_search-problems/02_search-problems.mp4 19.2 MB02_linear-programming/03_basic-tools/02_duality.mp4 19.0 MB01_flows-in-networks/05_applications/01_bipartite-matching.mp4 18.8 MB01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.mp4 18.2 MB02_linear-programming/04_algorithms/02_the-simplex-algorithm.mp4 18.0 MB04_coping-with-np-completeness/03_special-cases/01_2-sat.mp4 17.5 MB04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.mp4 16.0 MB04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.mp4 15.9 MB03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.mp4 15.7 MB01_flows-in-networks/03_basic-tools/01_residual-networks.mp4 15.5 MB02_linear-programming/03_basic-tools/01_convexity.mp4 14.8 MB02_linear-programming/04_algorithms/01_linear-programming-formulations.mp4 14.6 MB02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.mp4 14.6 MB01_flows-in-networks/02_flows-in-networks/02_network-flows.mp4 14.5 MB03_np-complete-problems/03_reductions/02_showing-np-completeness.mp4 13.9 MB03_np-complete-problems/03_reductions/01_reductions.mp4 13.7 MB03_np-complete-problems/03_reductions/05_sat-to-3-sat.mp4 13.5 MB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.mp4 13.3 MB02_linear-programming/02_introduction/02_linear-programming.mp4 13.2 MB03_np-complete-problems/02_search-problems/01_brute-force-search.mp4 12.5 MB03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.mp4 12.4 MB02_linear-programming/03_basic-tools/03_optional-duality-proofs.mp4 12.1 MB01_flows-in-networks/05_applications/02_image-segmentation.mp4 11.4 MB03_np-complete-problems/02_search-problems/08_p-and-np.mp4 11.2 MB01_flows-in-networks/03_basic-tools/02_maxflow-mincut.mp4 11.1 MB02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.mp4 10.9 MB04_coping-with-np-completeness/02_introduction/01_introduction.mp4 10.6 MB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mp4 10.4 MB03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.mp4 10.3 MB02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.mp4 9.1 MB03_np-complete-problems/02_search-problems/07_independent-set-problem.mp4 8.6 MB02_linear-programming/02_introduction/01_introduction.mp4 8.6 MB03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.mp4 8.3 MB01_flows-in-networks/02_flows-in-networks/01_introduction.mp4 5.8 MB01_flows-in-networks/04_maxflow-algorithms/02_slow-example.mp4 5.1 MB03_np-complete-problems/02_search-problems/05_longest-path-problem.mp4 4.5 MB
01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_Programming_Assignment_1.pdf 3.0 MB04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_Programming_Assignment_4.pdf 1.6 MB03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_Programming_Assignment_3.pdf 1.2 MB02_linear-programming/05_programming-assignment/01_programming-assignment-2_Programming_Assignment_2.pdf 944.4 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_6_example.pdf 723.4 kB01_flows-in-networks/04_maxflow-algorithms/02_slow-example_15_flows_6_example.pdf 723.4 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_8_bipartite_matching.pdf 690.5 kB01_flows-in-networks/05_applications/01_bipartite-matching_15_flows_8_bipartite_matching.pdf 690.5 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_7_edmonds_karp.pdf 671.4 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_1_transporting_goods.pdf 467.3 kB01_flows-in-networks/02_flows-in-networks/01_introduction_15_flows_1_transporting_goods.pdf 467.3 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_5_Formulations.pdf 466.8 kB04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_3_exact_algorithms.pdf 439.0 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_5_ford_fulkerson.pdf 422.9 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm_15_flows_5_ford_fulkerson.pdf 422.9 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_2_network_flows.pdf 420.5 kB01_flows-in-networks/02_flows-in-networks/02_network-flows_15_flows_2_network_flows.pdf 420.5 kB05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_ProgrammingAssignment5.pdf 408.2 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_4_maxflow_mincut.pdf 367.2 kB01_flows-in-networks/03_basic-tools/02_maxflow-mincut_15_flows_4_maxflow_mincut.pdf 367.2 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_3_residual_networks.pdf 358.7 kB01_flows-in-networks/03_basic-tools/01_residual-networks_15_flows_3_residual_networks.pdf 358.7 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_3_Convexity.pdf 330.0 kB03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_17_np_complete_problems_2_reductions.pdf 314.5 kB03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_17_np_complete_problems_1_search_problems.pdf 292.7 kB
01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_Programming_Assignment_1.zip 292.4 kB04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_2_special_cases.pdf 290.2 kB04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_4_approximation_algorithms.pdf 288.6 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_7_ellipsoid.pdf 281.9 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_6_simplex.pdf 263.3 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_9_image_segmentation.pdf 261.3 kB01_flows-in-networks/05_applications/02_image-segmentation_15_flows_9_image_segmentation.pdf 261.3 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_GaussianElimination.pdf 241.5 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_4_2_DualityProofs.pdf 224.3 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_4_1_Duality.pdf 208.3 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_1_2_LP.pdf 191.6 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_2_GaussianElimination.pdf 182.8 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_1_1_introduction.pdf 162.7 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_1_Substitution.pdf 133.4 kB04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_1_introduction.pdf 121.9 kB02_linear-programming/05_programming-assignment/01_programming-assignment-2_Programming_Assignment_2.zip 26.9 kB
03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.en.srt 18.4 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ro.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.en.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.et.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ja.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.sv.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ta.srt 18.3 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.te.srt 18.3 kB02_linear-programming/03_basic-tools/02_duality.en.srt 18.2 kB04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.en.srt 18.2 kB03_np-complete-problems/03_reductions/08_using-sat-solvers.en.srt 17.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.en.srt 16.9 kB04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.en.srt 16.8 kB01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.en.srt 16.4 kB01_flows-in-networks/05_applications/01_bipartite-matching.en.srt 16.4 kB04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.en.srt 16.1 kB04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.en.srt 16.0 kB
01_flows-in-networks/06_programming-assignment/02_faq-on-programming-assignments_instructions.html 15.9 kB02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.en.srt 15.0 kB02_linear-programming/04_algorithms/02_the-simplex-algorithm.en.srt 14.9 kB04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.en.srt 14.8 kB01_flows-in-networks/03_basic-tools/01_residual-networks.en.srt 14.1 kB03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.en.srt 14.0 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ro.srt 13.9 kB02_linear-programming/04_algorithms/01_linear-programming-formulations.en.srt 13.8 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.th.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ja.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.de.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.tr.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.en.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.et.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ka.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.kk.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.mn.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ne.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sk.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sq.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sr.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sv.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ta.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.te.srt 13.6 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.lt.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ja.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sk.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.en.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.et.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.kk.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.lt.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.mn.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ne.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sq.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sr.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sv.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ta.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.te.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.th.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.de.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ro.srt 13.6 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.tr.srt 13.6 kB02_linear-programming/02_introduction/02_linear-programming.en.srt 13.2 kB02_linear-programming/03_basic-tools/01_convexity.en.srt 13.0 kB04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.en.srt 12.4 kB04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.en.srt 12.4 kB03_np-complete-problems/02_search-problems/02_search-problems.en.srt 12.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.en.srt 11.9 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mn.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.de.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.en.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.et.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ja.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.kk.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.lt.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ne.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ro.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sk.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sq.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sr.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sv.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ta.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.te.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.th.srt 11.6 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.tr.srt 11.6 kB
03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.en.txt 11.5 kB04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.en.txt 11.4 kB02_linear-programming/03_basic-tools/02_duality.en.txt 11.3 kB01_flows-in-networks/03_basic-tools/02_maxflow-mincut.en.srt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ro.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.en.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.et.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ja.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.sv.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ta.txt 11.2 kB04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.te.txt 11.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.en.srt 11.1 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.en.srt 11.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.en.txt 11.0 kB01_flows-in-networks/05_applications/02_image-segmentation.en.srt 10.9 kB03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.en.srt 10.7 kB02_linear-programming/03_basic-tools/03_optional-duality-proofs.en.srt 10.7 kB03_np-complete-problems/03_reductions/08_using-sat-solvers.en.txt 10.6 kB04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_Programming_Assignment_4.zip 10.6 kB01_flows-in-networks/05_applications/01_bipartite-matching.en.txt 10.4 kB01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.en.txt 10.3 kB04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.en.txt 10.3 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.en.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ka.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.lt.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ro.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.sk.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ta.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.te.srt 10.0 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.th.srt 10.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.en.srt 10.0 kB04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.en.txt 9.9 kB02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.en.srt 9.8 kB04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.en.txt 9.8 kB02_linear-programming/04_algorithms/02_the-simplex-algorithm.en.txt 9.5 kB02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.en.txt 9.2 kB04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.en.txt 9.2 kB01_flows-in-networks/03_basic-tools/01_residual-networks.en.txt 9.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.en.srt 9.1 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ja.txt 8.8 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sk.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.en.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.et.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.kk.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.lt.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.mn.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ne.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sq.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sr.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.sv.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ta.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.te.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.th.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.de.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.ro.txt 8.7 kB01_flows-in-networks/02_flows-in-networks/02_network-flows.tr.txt 8.7 kB02_linear-programming/04_algorithms/01_linear-programming-formulations.en.txt 8.5 kB03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.en.txt 8.5 kB03_np-complete-problems/03_reductions/05_sat-to-3-sat.en.srt 8.4 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ro.txt 8.4 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.th.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ja.txt 8.3 kB04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.en.srt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.de.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.tr.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.en.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.et.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ka.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.kk.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.mn.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ne.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sk.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sq.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sr.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.sv.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.ta.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.te.txt 8.3 kB04_coping-with-np-completeness/03_special-cases/01_2-sat.lt.txt 8.3 kB02_linear-programming/03_basic-tools/01_convexity.en.txt 8.2 kB02_linear-programming/02_introduction/02_linear-programming.en.txt 8.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.en.srt 8.2 kB03_np-complete-problems/03_reductions/02_showing-np-completeness.en.srt 8.1 kB04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.en.txt 7.8 kB04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.en.txt 7.8 kB02_linear-programming/02_introduction/01_introduction.en.srt 7.7 kB03_np-complete-problems/02_search-problems/01_brute-force-search.en.srt 7.7 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.en.srt 7.6 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.en.srt 7.5 kB02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.en.srt 7.5 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.en.txt 7.4 kB03_np-complete-problems/02_search-problems/02_search-problems.en.txt 7.3 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mn.txt 7.2 kB01_flows-in-networks/03_basic-tools/02_maxflow-mincut.en.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.de.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.en.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.et.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ja.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.kk.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.lt.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ne.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ro.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sk.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sq.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sr.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sv.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ta.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.te.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.th.txt 7.2 kB01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.tr.txt 7.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.en.txt 7.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.en.txt 7.0 kB02_linear-programming/02_introduction/01_introduction.zh-CN.srt 7.0 kB03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.en.srt 6.9 kB01_flows-in-networks/05_applications/02_image-segmentation.en.txt 6.8 kB02_linear-programming/03_basic-tools/03_optional-duality-proofs.en.txt 6.8 kB03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.en.txt 6.7 kB03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.en.srt 6.5 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.en.srt 6.3 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.en.txt 6.3 kB03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_Programming_Assignment_3.zip 6.3 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.en.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ka.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.lt.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ro.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.sk.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ta.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.te.txt 6.2 kB03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.th.txt 6.2 kB02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.en.txt 6.2 kB04_coping-with-np-completeness/02_introduction/01_introduction.en.srt 5.9 kB03_np-complete-problems/03_reductions/01_reductions.en.srt 5.8 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.en.txt 5.7 kB04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.en.txt 5.3 kB01_flows-in-networks/04_maxflow-algorithms/02_slow-example.en.srt 5.2 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.en.txt 5.2 kB03_np-complete-problems/03_reductions/05_sat-to-3-sat.en.txt 5.2 kB01_flows-in-networks/02_flows-in-networks/01_introduction.en.srt 5.0 kB03_np-complete-problems/02_search-problems/08_p-and-np.en.srt 5.0 kB03_np-complete-problems/03_reductions/02_showing-np-completeness.en.txt 5.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.en.txt 4.9 kB03_np-complete-problems/02_search-problems/01_brute-force-search.en.txt 4.8 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.en.txt 4.8 kB02_linear-programming/02_introduction/01_introduction.en.txt 4.8 kB02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.en.txt 4.6 kB03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.en.txt 4.3 kB01_flows-in-networks/06_programming-assignment/01_available-programming-languages_instructions.html 4.3 kB03_np-complete-problems/02_search-problems/07_independent-set-problem.en.srt 4.2 kB03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.en.txt 4.0 kB02_linear-programming/02_introduction/01_introduction.zh-CN.txt 4.0 kB03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.en.srt 4.0 kB05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.en.txt 3.9 kB04_coping-with-np-completeness/02_introduction/01_introduction.en.txt 3.7 kB03_np-complete-problems/03_reductions/01_reductions.en.txt 3.7 kB01_flows-in-networks/02_flows-in-networks/01_introduction.en.txt 3.3 kB01_flows-in-networks/04_maxflow-algorithms/02_slow-example.en.txt 3.2 kB03_np-complete-problems/02_search-problems/08_p-and-np.en.txt 3.2 kB03_np-complete-problems/02_search-problems/07_independent-set-problem.en.txt 2.7 kB03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.en.txt 2.5 kB02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_instructions.html 2.5 kB01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_instructions.html 2.5 kB01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_instructions.html 2.2 kB03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_sudokusolver.py 2.2 kB03_np-complete-problems/02_search-problems/05_longest-path-problem.en.srt 2.1 kB06_Resources/01_resources/01__resources.html 2.1 kB04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_instructions.html 2.0 kB03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_instructions.html 1.8 kB02_linear-programming/05_programming-assignment/01_programming-assignment-2_instructions.html 1.8 kB03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_instructions.html 1.5 kB04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_instructions.html 1.5 kB03_np-complete-problems/02_search-problems/05_longest-path-problem.en.txt 1.4 kB
[FTU Forum].url 1.4 kB05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_starter_files.zip 1.3 kB05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_instructions.html 1.3 kB[FreeCoursesOnline.Me].url 133 Bytes[FreeTutorials.Eu].url 129 Bytes [FreeCoursesOnline.Us] Linkedin - Creating Your First... 337.8 MB [FreeCoursesOnline.Me] eCom BluePrint By Gabriel St-Germain [FCO] 1.4 GB [FreeCoursesOnline.Us] Lynda - Design the Web - Creating... 96.1 MB [FreeCoursesOnline.Me] [LYNDA] 3ds Max Tips, Tricks and... 4.3 GB [FreeCoursesOnline.Us] Pluralsight - Java Path - java-generics 823.8 MB [FreeCoursesOnline.Me] Lynda - AutoCAD Importing a 2D... 294.8 MB [FreeCoursesOnline.Me] [LYNDA] Illustrator CC 2019... 3.4 GB [FreeCoursesOnline.Me] [FrontendMasters] TypeScript 3... 1.4 GB [FreeCoursesOnline.Me] [VueSchool] Vue.js + Firebase... 296.7 MB [FreeCoursesOnline.Me] [Packt] Learn to Build... 1.3 GB