589689.xyz

[] Coursera - Advanced Algorithms and Complexity

  • 收录时间:2019-02-23 23:01:06
  • 文件大小:986MB
  • 下载次数:88
  • 最近下载:2021-01-15 14:24:56
  • 磁力链接:
立即下载 复制链接

文件列表

  1. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.mp4 53MB
  2. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.mp4 33MB
  3. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.mp4 32MB
  4. 03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.mp4 30MB
  5. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.mp4 29MB
  6. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.mp4 28MB
  7. 04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.mp4 28MB
  8. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.mp4 27MB
  9. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.mp4 27MB
  10. 03_np-complete-problems/03_reductions/08_using-sat-solvers.mp4 25MB
  11. 04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.mp4 24MB
  12. 04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.mp4 23MB
  13. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.mp4 23MB
  14. 04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.mp4 22MB
  15. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.mp4 21MB
  16. 04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.mp4 21MB
  17. 03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.mp4 20MB
  18. 04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.mp4 19MB
  19. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.mp4 19MB
  20. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.mp4 19MB
  21. 03_np-complete-problems/02_search-problems/02_search-problems.mp4 18MB
  22. 02_linear-programming/03_basic-tools/02_duality.mp4 18MB
  23. 01_flows-in-networks/05_applications/01_bipartite-matching.mp4 18MB
  24. 01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.mp4 17MB
  25. 02_linear-programming/04_algorithms/02_the-simplex-algorithm.mp4 17MB
  26. 04_coping-with-np-completeness/03_special-cases/01_2-sat.mp4 17MB
  27. 04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.mp4 15MB
  28. 04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.mp4 15MB
  29. 03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.mp4 15MB
  30. 01_flows-in-networks/03_basic-tools/01_residual-networks.mp4 15MB
  31. 02_linear-programming/03_basic-tools/01_convexity.mp4 14MB
  32. 02_linear-programming/04_algorithms/01_linear-programming-formulations.mp4 14MB
  33. 02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.mp4 14MB
  34. 01_flows-in-networks/02_flows-in-networks/02_network-flows.mp4 14MB
  35. 03_np-complete-problems/03_reductions/02_showing-np-completeness.mp4 13MB
  36. 03_np-complete-problems/03_reductions/01_reductions.mp4 13MB
  37. 03_np-complete-problems/03_reductions/05_sat-to-3-sat.mp4 13MB
  38. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.mp4 13MB
  39. 02_linear-programming/02_introduction/02_linear-programming.mp4 13MB
  40. 03_np-complete-problems/02_search-problems/01_brute-force-search.mp4 12MB
  41. 03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.mp4 12MB
  42. 02_linear-programming/03_basic-tools/03_optional-duality-proofs.mp4 12MB
  43. 01_flows-in-networks/05_applications/02_image-segmentation.mp4 11MB
  44. 03_np-complete-problems/02_search-problems/08_p-and-np.mp4 11MB
  45. 01_flows-in-networks/03_basic-tools/02_maxflow-mincut.mp4 11MB
  46. 02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.mp4 10MB
  47. 04_coping-with-np-completeness/02_introduction/01_introduction.mp4 10MB
  48. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mp4 10MB
  49. 03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.mp4 10MB
  50. 02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.mp4 9MB
  51. 03_np-complete-problems/02_search-problems/07_independent-set-problem.mp4 8MB
  52. 02_linear-programming/02_introduction/01_introduction.mp4 8MB
  53. 03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.mp4 8MB
  54. 01_flows-in-networks/02_flows-in-networks/01_introduction.mp4 5MB
  55. 01_flows-in-networks/04_maxflow-algorithms/02_slow-example.mp4 5MB
  56. 03_np-complete-problems/02_search-problems/05_longest-path-problem.mp4 4MB
  57. 01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_Programming_Assignment_1.pdf 3MB
  58. 04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_Programming_Assignment_4.pdf 2MB
  59. 03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_Programming_Assignment_3.pdf 1MB
  60. 02_linear-programming/05_programming-assignment/01_programming-assignment-2_Programming_Assignment_2.pdf 922KB
  61. 01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_15_flows_6_example.pdf 706KB
  62. 01_flows-in-networks/04_maxflow-algorithms/02_slow-example_15_flows_6_example.pdf 706KB
  63. 01_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 674KB
  64. 01_flows-in-networks/05_applications/01_bipartite-matching_15_flows_8_bipartite_matching.pdf 674KB
  65. 01_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 656KB
  66. 01_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 456KB
  67. 01_flows-in-networks/02_flows-in-networks/01_introduction_15_flows_1_transporting_goods.pdf 456KB
  68. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_5_Formulations.pdf 456KB
  69. 04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_3_exact_algorithms.pdf 429KB
  70. 01_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 413KB
  71. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm_15_flows_5_ford_fulkerson.pdf 413KB
  72. 01_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 411KB
  73. 01_flows-in-networks/02_flows-in-networks/02_network-flows_15_flows_2_network_flows.pdf 411KB
  74. 05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_ProgrammingAssignment5.pdf 399KB
  75. 01_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 359KB
  76. 01_flows-in-networks/03_basic-tools/02_maxflow-mincut_15_flows_4_maxflow_mincut.pdf 359KB
  77. 01_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 350KB
  78. 01_flows-in-networks/03_basic-tools/01_residual-networks_15_flows_3_residual_networks.pdf 350KB
  79. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_3_Convexity.pdf 322KB
  80. 03_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 307KB
  81. 03_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 286KB
  82. 01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_Programming_Assignment_1.zip 286KB
  83. 04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_2_special_cases.pdf 283KB
  84. 04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_4_approximation_algorithms.pdf 282KB
  85. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_7_ellipsoid.pdf 275KB
  86. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_6_simplex.pdf 257KB
  87. 01_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 255KB
  88. 01_flows-in-networks/05_applications/02_image-segmentation_15_flows_9_image_segmentation.pdf 255KB
  89. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_GaussianElimination.pdf 236KB
  90. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_4_2_DualityProofs.pdf 219KB
  91. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_4_1_Duality.pdf 203KB
  92. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_1_2_LP.pdf 187KB
  93. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_2_GaussianElimination.pdf 179KB
  94. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_1_1_introduction.pdf 159KB
  95. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_16_LP_2_1_Substitution.pdf 130KB
  96. 04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_18_coping_with_np_completeness_1_introduction.pdf 119KB
  97. 02_linear-programming/05_programming-assignment/01_programming-assignment-2_Programming_Assignment_2.zip 26KB
  98. 03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.en.srt 18KB
  99. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ro.srt 18KB
  100. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.en.srt 18KB
  101. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.et.srt 18KB
  102. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ja.srt 18KB
  103. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.sv.srt 18KB
  104. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ta.srt 18KB
  105. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.te.srt 18KB
  106. 02_linear-programming/03_basic-tools/02_duality.en.srt 18KB
  107. 04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.en.srt 18KB
  108. 03_np-complete-problems/03_reductions/08_using-sat-solvers.en.srt 17KB
  109. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.en.srt 17KB
  110. 04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.en.srt 16KB
  111. 01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.en.srt 16KB
  112. 01_flows-in-networks/05_applications/01_bipartite-matching.en.srt 16KB
  113. 04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.en.srt 16KB
  114. 04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.en.srt 16KB
  115. 01_flows-in-networks/06_programming-assignment/02_faq-on-programming-assignments_instructions.html 15KB
  116. 02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.en.srt 15KB
  117. 02_linear-programming/04_algorithms/02_the-simplex-algorithm.en.srt 15KB
  118. 04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.en.srt 14KB
  119. 01_flows-in-networks/03_basic-tools/01_residual-networks.en.srt 14KB
  120. 03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.en.srt 14KB
  121. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ro.srt 14KB
  122. 02_linear-programming/04_algorithms/01_linear-programming-formulations.en.srt 13KB
  123. 04_coping-with-np-completeness/03_special-cases/01_2-sat.th.srt 13KB
  124. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ja.srt 13KB
  125. 04_coping-with-np-completeness/03_special-cases/01_2-sat.de.srt 13KB
  126. 04_coping-with-np-completeness/03_special-cases/01_2-sat.tr.srt 13KB
  127. 04_coping-with-np-completeness/03_special-cases/01_2-sat.en.srt 13KB
  128. 04_coping-with-np-completeness/03_special-cases/01_2-sat.et.srt 13KB
  129. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ka.srt 13KB
  130. 04_coping-with-np-completeness/03_special-cases/01_2-sat.kk.srt 13KB
  131. 04_coping-with-np-completeness/03_special-cases/01_2-sat.mn.srt 13KB
  132. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ne.srt 13KB
  133. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sk.srt 13KB
  134. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sq.srt 13KB
  135. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sr.srt 13KB
  136. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sv.srt 13KB
  137. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ta.srt 13KB
  138. 04_coping-with-np-completeness/03_special-cases/01_2-sat.te.srt 13KB
  139. 04_coping-with-np-completeness/03_special-cases/01_2-sat.lt.srt 13KB
  140. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ja.srt 13KB
  141. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sk.srt 13KB
  142. 01_flows-in-networks/02_flows-in-networks/02_network-flows.en.srt 13KB
  143. 01_flows-in-networks/02_flows-in-networks/02_network-flows.et.srt 13KB
  144. 01_flows-in-networks/02_flows-in-networks/02_network-flows.kk.srt 13KB
  145. 01_flows-in-networks/02_flows-in-networks/02_network-flows.lt.srt 13KB
  146. 01_flows-in-networks/02_flows-in-networks/02_network-flows.mn.srt 13KB
  147. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ne.srt 13KB
  148. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sq.srt 13KB
  149. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sr.srt 13KB
  150. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sv.srt 13KB
  151. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ta.srt 13KB
  152. 01_flows-in-networks/02_flows-in-networks/02_network-flows.te.srt 13KB
  153. 01_flows-in-networks/02_flows-in-networks/02_network-flows.th.srt 13KB
  154. 01_flows-in-networks/02_flows-in-networks/02_network-flows.de.srt 13KB
  155. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ro.srt 13KB
  156. 01_flows-in-networks/02_flows-in-networks/02_network-flows.tr.srt 13KB
  157. 02_linear-programming/02_introduction/02_linear-programming.en.srt 13KB
  158. 02_linear-programming/03_basic-tools/01_convexity.en.srt 13KB
  159. 04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.en.srt 12KB
  160. 04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.en.srt 12KB
  161. 03_np-complete-problems/02_search-problems/02_search-problems.en.srt 12KB
  162. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.en.srt 12KB
  163. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mn.srt 11KB
  164. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.de.srt 11KB
  165. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.en.srt 11KB
  166. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.et.srt 11KB
  167. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ja.srt 11KB
  168. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.kk.srt 11KB
  169. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.lt.srt 11KB
  170. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ne.srt 11KB
  171. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ro.srt 11KB
  172. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sk.srt 11KB
  173. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sq.srt 11KB
  174. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sr.srt 11KB
  175. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sv.srt 11KB
  176. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ta.srt 11KB
  177. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.te.srt 11KB
  178. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.th.srt 11KB
  179. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.tr.srt 11KB
  180. 03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.en.txt 11KB
  181. 04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.en.txt 11KB
  182. 02_linear-programming/03_basic-tools/02_duality.en.txt 11KB
  183. 01_flows-in-networks/03_basic-tools/02_maxflow-mincut.en.srt 11KB
  184. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ro.txt 11KB
  185. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.en.txt 11KB
  186. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.et.txt 11KB
  187. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ja.txt 11KB
  188. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.sv.txt 11KB
  189. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.ta.txt 11KB
  190. 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.te.txt 11KB
  191. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.en.srt 11KB
  192. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.en.srt 11KB
  193. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.en.txt 11KB
  194. 01_flows-in-networks/05_applications/02_image-segmentation.en.srt 11KB
  195. 03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.en.srt 10KB
  196. 02_linear-programming/03_basic-tools/03_optional-duality-proofs.en.srt 10KB
  197. 03_np-complete-problems/03_reductions/08_using-sat-solvers.en.txt 10KB
  198. 04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_Programming_Assignment_4.zip 10KB
  199. 01_flows-in-networks/05_applications/01_bipartite-matching.en.txt 10KB
  200. 01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.en.txt 10KB
  201. 04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.en.txt 10KB
  202. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.en.srt 10KB
  203. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ka.srt 10KB
  204. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.lt.srt 10KB
  205. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ro.srt 10KB
  206. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.sk.srt 10KB
  207. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ta.srt 10KB
  208. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.te.srt 10KB
  209. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.th.srt 10KB
  210. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.en.srt 10KB
  211. 04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.en.txt 10KB
  212. 02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.en.srt 10KB
  213. 04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.en.txt 10KB
  214. 02_linear-programming/04_algorithms/02_the-simplex-algorithm.en.txt 9KB
  215. 02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.en.txt 9KB
  216. 04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.en.txt 9KB
  217. 01_flows-in-networks/03_basic-tools/01_residual-networks.en.txt 9KB
  218. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.en.srt 9KB
  219. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ja.txt 9KB
  220. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sk.txt 9KB
  221. 01_flows-in-networks/02_flows-in-networks/02_network-flows.en.txt 9KB
  222. 01_flows-in-networks/02_flows-in-networks/02_network-flows.et.txt 9KB
  223. 01_flows-in-networks/02_flows-in-networks/02_network-flows.kk.txt 9KB
  224. 01_flows-in-networks/02_flows-in-networks/02_network-flows.lt.txt 9KB
  225. 01_flows-in-networks/02_flows-in-networks/02_network-flows.mn.txt 9KB
  226. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ne.txt 9KB
  227. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sq.txt 9KB
  228. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sr.txt 9KB
  229. 01_flows-in-networks/02_flows-in-networks/02_network-flows.sv.txt 9KB
  230. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ta.txt 9KB
  231. 01_flows-in-networks/02_flows-in-networks/02_network-flows.te.txt 9KB
  232. 01_flows-in-networks/02_flows-in-networks/02_network-flows.th.txt 9KB
  233. 01_flows-in-networks/02_flows-in-networks/02_network-flows.de.txt 9KB
  234. 01_flows-in-networks/02_flows-in-networks/02_network-flows.ro.txt 9KB
  235. 01_flows-in-networks/02_flows-in-networks/02_network-flows.tr.txt 9KB
  236. 02_linear-programming/04_algorithms/01_linear-programming-formulations.en.txt 8KB
  237. 03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.en.txt 8KB
  238. 03_np-complete-problems/03_reductions/05_sat-to-3-sat.en.srt 8KB
  239. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ro.txt 8KB
  240. 04_coping-with-np-completeness/03_special-cases/01_2-sat.th.txt 8KB
  241. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ja.txt 8KB
  242. 04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.en.srt 8KB
  243. 04_coping-with-np-completeness/03_special-cases/01_2-sat.de.txt 8KB
  244. 04_coping-with-np-completeness/03_special-cases/01_2-sat.tr.txt 8KB
  245. 04_coping-with-np-completeness/03_special-cases/01_2-sat.en.txt 8KB
  246. 04_coping-with-np-completeness/03_special-cases/01_2-sat.et.txt 8KB
  247. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ka.txt 8KB
  248. 04_coping-with-np-completeness/03_special-cases/01_2-sat.kk.txt 8KB
  249. 04_coping-with-np-completeness/03_special-cases/01_2-sat.mn.txt 8KB
  250. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ne.txt 8KB
  251. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sk.txt 8KB
  252. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sq.txt 8KB
  253. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sr.txt 8KB
  254. 04_coping-with-np-completeness/03_special-cases/01_2-sat.sv.txt 8KB
  255. 04_coping-with-np-completeness/03_special-cases/01_2-sat.ta.txt 8KB
  256. 04_coping-with-np-completeness/03_special-cases/01_2-sat.te.txt 8KB
  257. 04_coping-with-np-completeness/03_special-cases/01_2-sat.lt.txt 8KB
  258. 02_linear-programming/03_basic-tools/01_convexity.en.txt 8KB
  259. 02_linear-programming/02_introduction/02_linear-programming.en.txt 8KB
  260. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.en.srt 8KB
  261. 03_np-complete-problems/03_reductions/02_showing-np-completeness.en.srt 8KB
  262. 04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.en.txt 8KB
  263. 04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.en.txt 8KB
  264. 02_linear-programming/02_introduction/01_introduction.en.srt 8KB
  265. 03_np-complete-problems/02_search-problems/01_brute-force-search.en.srt 8KB
  266. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.en.srt 7KB
  267. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.en.srt 7KB
  268. 02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.en.srt 7KB
  269. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.en.txt 7KB
  270. 03_np-complete-problems/02_search-problems/02_search-problems.en.txt 7KB
  271. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mn.txt 7KB
  272. 01_flows-in-networks/03_basic-tools/02_maxflow-mincut.en.txt 7KB
  273. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.de.txt 7KB
  274. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.en.txt 7KB
  275. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.et.txt 7KB
  276. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ja.txt 7KB
  277. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.kk.txt 7KB
  278. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.lt.txt 7KB
  279. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ne.txt 7KB
  280. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ro.txt 7KB
  281. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sk.txt 7KB
  282. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sq.txt 7KB
  283. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sr.txt 7KB
  284. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.sv.txt 7KB
  285. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.ta.txt 7KB
  286. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.te.txt 7KB
  287. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.th.txt 7KB
  288. 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.tr.txt 7KB
  289. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.en.txt 7KB
  290. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.en.txt 7KB
  291. 02_linear-programming/02_introduction/01_introduction.zh-CN.srt 7KB
  292. 03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.en.srt 7KB
  293. 01_flows-in-networks/05_applications/02_image-segmentation.en.txt 7KB
  294. 02_linear-programming/03_basic-tools/03_optional-duality-proofs.en.txt 7KB
  295. 03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.en.txt 7KB
  296. 03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.en.srt 6KB
  297. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.en.srt 6KB
  298. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.en.txt 6KB
  299. 03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_Programming_Assignment_3.zip 6KB
  300. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.en.txt 6KB
  301. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ka.txt 6KB
  302. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.lt.txt 6KB
  303. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ro.txt 6KB
  304. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.sk.txt 6KB
  305. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.ta.txt 6KB
  306. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.te.txt 6KB
  307. 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.th.txt 6KB
  308. 02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.en.txt 6KB
  309. 04_coping-with-np-completeness/02_introduction/01_introduction.en.srt 6KB
  310. 03_np-complete-problems/03_reductions/01_reductions.en.srt 6KB
  311. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.en.txt 6KB
  312. 04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.en.txt 5KB
  313. 01_flows-in-networks/04_maxflow-algorithms/02_slow-example.en.srt 5KB
  314. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.en.txt 5KB
  315. 03_np-complete-problems/03_reductions/05_sat-to-3-sat.en.txt 5KB
  316. 01_flows-in-networks/02_flows-in-networks/01_introduction.en.srt 5KB
  317. 03_np-complete-problems/02_search-problems/08_p-and-np.en.srt 5KB
  318. 03_np-complete-problems/03_reductions/02_showing-np-completeness.en.txt 5KB
  319. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.en.txt 5KB
  320. 03_np-complete-problems/02_search-problems/01_brute-force-search.en.txt 5KB
  321. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.en.txt 5KB
  322. 02_linear-programming/02_introduction/01_introduction.en.txt 5KB
  323. 02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.en.txt 5KB
  324. 03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.en.txt 4KB
  325. 01_flows-in-networks/06_programming-assignment/01_available-programming-languages_instructions.html 4KB
  326. 03_np-complete-problems/02_search-problems/07_independent-set-problem.en.srt 4KB
  327. 03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.en.txt 4KB
  328. 02_linear-programming/02_introduction/01_introduction.zh-CN.txt 4KB
  329. 03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.en.srt 4KB
  330. 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.en.txt 4KB
  331. 04_coping-with-np-completeness/02_introduction/01_introduction.en.txt 4KB
  332. 03_np-complete-problems/03_reductions/01_reductions.en.txt 4KB
  333. 01_flows-in-networks/02_flows-in-networks/01_introduction.en.txt 3KB
  334. 01_flows-in-networks/04_maxflow-algorithms/02_slow-example.en.txt 3KB
  335. 03_np-complete-problems/02_search-problems/08_p-and-np.en.txt 3KB
  336. 03_np-complete-problems/02_search-problems/07_independent-set-problem.en.txt 3KB
  337. 03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.en.txt 2KB
  338. 02_linear-programming/01_slides-and-resources-on-linear-programming/01_slides-and-resources-on-linear-programming_instructions.html 2KB
  339. 01_flows-in-networks/01_slides-and-resources-on-flows-in-networks/01_slides-and-resources-on-flows-in-networks_instructions.html 2KB
  340. 01_flows-in-networks/06_programming-assignment/03_programming-assignment-1_instructions.html 2KB
  341. 03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_sudokusolver.py 2KB
  342. 03_np-complete-problems/02_search-problems/05_longest-path-problem.en.srt 2KB
  343. 06_Resources/01_resources/01__resources.html 2KB
  344. 04_coping-with-np-completeness/01_slides/01_slides-and-resources-on-coping-with-np-completeness_instructions.html 2KB
  345. 03_np-complete-problems/01_slides-and-resources-on-np-complete-problems/01_slides-and-resources-on-np-complete-problems_instructions.html 2KB
  346. 02_linear-programming/05_programming-assignment/01_programming-assignment-2_instructions.html 2KB
  347. 03_np-complete-problems/04_programming-assignment/01_programming-assignment-3_instructions.html 1KB
  348. 04_coping-with-np-completeness/06_programming-assignment/01_programming-assignment-4_instructions.html 1KB
  349. 03_np-complete-problems/02_search-problems/05_longest-path-problem.en.txt 1KB
  350. 05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_starter_files.zip 1KB
  351. 05_streaming-algorithms-optional/02_programming-assignment/01_optional-programming-assignment-5_instructions.html 1KB
  352. [CourseClub.NET].url 123B
  353. [DesireCourse.Com].url 51B