本站已收录 番号和无损神作磁力链接/BT种子 

[CourseClub.NET] Coursera - Advanced Algorithms and Complexity

种子简介

种子名称: [CourseClub.NET] Coursera - Advanced Algorithms and Complexity
文件类型: 视频
文件数目: 56个文件
文件大小: 964.86 MB
收录时间: 2019-8-28 18:02
已经下载: 3
资源热度: 185
最近下载: 2024-11-4 00:17

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:159a374c5e4f6158753d2660dfd1e2e7a7da0151&dn=[CourseClub.NET] Coursera - Advanced Algorithms and Complexity 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[CourseClub.NET] Coursera - Advanced Algorithms and Complexity.torrent
  • 01_flows-in-networks/02_flows-in-networks/01_introduction.mp45.5MB
  • 01_flows-in-networks/02_flows-in-networks/02_network-flows.mp413.86MB
  • 01_flows-in-networks/03_basic-tools/01_residual-networks.mp414.78MB
  • 01_flows-in-networks/03_basic-tools/02_maxflow-mincut.mp410.6MB
  • 01_flows-in-networks/04_maxflow-algorithms/01_the-ford-fulkerson-algorithm.mp49.89MB
  • 01_flows-in-networks/04_maxflow-algorithms/02_slow-example.mp44.82MB
  • 01_flows-in-networks/04_maxflow-algorithms/03_the-edmonds-karp-algorithm.mp417.39MB
  • 01_flows-in-networks/05_applications/01_bipartite-matching.mp417.93MB
  • 01_flows-in-networks/05_applications/02_image-segmentation.mp410.84MB
  • 02_linear-programming/02_introduction/01_introduction.mp48.16MB
  • 02_linear-programming/02_introduction/02_linear-programming.mp412.62MB
  • 02_linear-programming/02_introduction/03_linear-algebra-method-of-substitution.mp48.7MB
  • 02_linear-programming/02_introduction/04_linear-algebra-gaussian-elimination.mp413.91MB
  • 02_linear-programming/03_basic-tools/01_convexity.mp414.07MB
  • 02_linear-programming/03_basic-tools/02_duality.mp418.16MB
  • 02_linear-programming/03_basic-tools/03_optional-duality-proofs.mp411.5MB
  • 02_linear-programming/04_algorithms/01_linear-programming-formulations.mp413.91MB
  • 02_linear-programming/04_algorithms/02_the-simplex-algorithm.mp417.14MB
  • 02_linear-programming/04_algorithms/03_optional-the-ellipsoid-algorithm.mp410.37MB
  • 03_np-complete-problems/02_search-problems/01_brute-force-search.mp411.93MB
  • 03_np-complete-problems/02_search-problems/02_search-problems.mp418.35MB
  • 03_np-complete-problems/02_search-problems/03_traveling-salesman-problem.mp414.96MB
  • 03_np-complete-problems/02_search-problems/04_hamiltonian-cycle-problem.mp412.72MB
  • 03_np-complete-problems/02_search-problems/05_longest-path-problem.mp44.28MB
  • 03_np-complete-problems/02_search-problems/06_integer-linear-programming-problem.mp47.9MB
  • 03_np-complete-problems/02_search-problems/07_independent-set-problem.mp48.16MB
  • 03_np-complete-problems/02_search-problems/08_p-and-np.mp410.68MB
  • 03_np-complete-problems/03_reductions/01_reductions.mp413.04MB
  • 03_np-complete-problems/03_reductions/02_showing-np-completeness.mp413.23MB
  • 03_np-complete-problems/03_reductions/03_independent-set-to-vertex-cover.mp411.86MB
  • 03_np-complete-problems/03_reductions/04_3-sat-to-independent-set.mp429.95MB
  • 03_np-complete-problems/03_reductions/05_sat-to-3-sat.mp412.86MB
  • 03_np-complete-problems/03_reductions/06_circuit-sat-to-sat.mp420.24MB
  • 03_np-complete-problems/03_reductions/07_all-of-np-to-circuit-sat.mp49.8MB
  • 03_np-complete-problems/03_reductions/08_using-sat-solvers.mp425.21MB
  • 04_coping-with-np-completeness/02_introduction/01_introduction.mp410.13MB
  • 04_coping-with-np-completeness/03_special-cases/01_2-sat.mp416.66MB
  • 04_coping-with-np-completeness/03_special-cases/02_2-sat-algorithm.mp419.49MB
  • 04_coping-with-np-completeness/03_special-cases/03_independent-sets-in-trees.mp423.66MB
  • 04_coping-with-np-completeness/04_exact-algorithms/01_3-sat-backtracking.mp422.26MB
  • 04_coping-with-np-completeness/04_exact-algorithms/02_3-sat-local-search.mp428.13MB
  • 04_coping-with-np-completeness/04_exact-algorithms/03_tsp-dynamic-programming.mp429.29MB
  • 04_coping-with-np-completeness/04_exact-algorithms/04_tsp-branch-and-bound.mp415.16MB
  • 04_coping-with-np-completeness/05_approximation-algorithms/01_vertex-cover.mp420.96MB
  • 04_coping-with-np-completeness/05_approximation-algorithms/02_metric-tsp.mp423.27MB
  • 04_coping-with-np-completeness/05_approximation-algorithms/03_tsp-local-search.mp415.29MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/01_introduction.mp421.14MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/02_heavy-hitters-problem.mp431.63MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/03_reduction-1.mp418.81MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/04_reduction-2.mp427MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/05_basic-estimate-1.mp432.94MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/06_basic-estimate-2.mp428.28MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/07_final-algorithm-1.mp422.76MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/08_final-algorithm-2.mp452.58MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/09_proofs-1.mp419.49MB
  • 05_streaming-algorithms-optional/01_finding-heavy-hitters-in-data-streams/10_proofs-2.mp426.62MB