Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures番号下载_Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures番号下载_Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures下载

Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures

种子简介

种子名称： Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures
文件类型：
文件数目： 34个文件
文件大小： 4.11 GB
收录时间： 2015-1-9 01:09
已经下载： 3次
资源热度： 233
最近下载： 2024-11-16 00:28

下载BT种子文件

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

磁力链接下载

magnet:?xt=urn:btih:14253C791EC74017667666F10D52C6C362B6D473&dn=Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures

种子包含的文件

Design Analysis of Algorithms - IITB-NPTEL Online Course Video Lectures.torrent

Lecture -18 Dynamic Programming-FreeVideoLecturesDOTcom.mp4230.33MB

Lecture - 27 NP - Compliteness - II-FreeVideoLecturesDOTcom.mp4177MB

Lecture - 29 NP-Completeness - IV-FreeVideoLecturesDOTcom.mp4161.67MB

Lecture -9 Divide And Conquer -IV Closest Pair-FreeVideoLecturesDOTcom.mp4140.92MB

Lecture -26 NP-Completeness-I -Motivation-FreeVideoLecturesDOTcom.mp4134.23MB

Lecture - 33 Approximation Algorithms-FreeVideoLecturesDOTcom.mp4133.44MB

Lecture - 28 NP-Completeness - III-FreeVideoLecturesDOTcom.mp4132.52MB

Lecture -8 Divide And Conquer -III Surfing Lower Bounds-FreeVideoLecturesDOTcom.mp4131.29MB

Lecture -25 Element Distinctness Lower Bounds-FreeVideoLecturesDOTcom.mp4126.61MB

Lecture - 34 Approximation Algorithms for NP-FreeVideoLecturesDOTcom.mp4126.39MB

Lecture 19 Longest Common Subsequences-FreeVideoLecturesDOTcom.mp4125.38MB

Lecture - 32 Approximation Algorithms-FreeVideoLecturesDOTcom.mp4125.22MB

Lecture -16 Combinational Search and Optimization I-FreeVideoLecturesDOTcom.mp4124.08MB

Lecture - 17 Combinational Search and Optimization II-FreeVideoLecturesDOTcom.mp4121.53MB

Lecture -7 Divide And Conquer -II Median Finding-FreeVideoLecturesDOTcom.mp4121.19MB

Lecture - 11 Greedy Algorithms - II-FreeVideoLecturesDOTcom.mp4121.04MB

Lecture - 3 Algorithms Analysis Framework - II-FreeVideoLecturesDOTcom.mp4120.81MB

Lecture - 14 Pattern Matching - I-FreeVideoLecturesDOTcom.mp4120.5MB

Lecture - 4 Asymptotic Notation-FreeVideoLecturesDOTcom.mp4120.21MB

Lecture -6 Divide And Conquer-I-FreeVideoLecturesDOTcom.mp4120.14MB

Lecture - 2 Framework for Algorithms Analysis-FreeVideoLecturesDOTcom.mp4119.82MB

Lecture -20 Matric Chain Multiplication-FreeVideoLecturesDOTcom.mp4117.79MB

Lecture - 23 Bipartite Maximum Matching-FreeVideoLecturesDOTcom.mp4117.68MB

Lecture - 1 Overview of the course-FreeVideoLecturesDOTcom.mp4116.07MB

Lecture - 12 Greedy Algorithms - III-FreeVideoLecturesDOTcom.mp4114.27MB

Lecture -10 Greedy Algorithms -I-FreeVideoLecturesDOTcom.mp4114.02MB

Lecture - 24 Lower Bounds for Sorting-FreeVideoLecturesDOTcom.mp4110.69MB

Lecture - 21 Scheduling with Startup and Holding Costs-FreeVideoLecturesDOTcom.mp4110.17MB

Lecture -5 Algorithm Design Techniques Basics-FreeVideoLecturesDOTcom.mp4104.59MB

Lecture - 22 Average case Analysis of Quicksort-FreeVideoLecturesDOTcom.mp4102.51MB

Lecture - 15 Pattern Matching - II-FreeVideoLecturesDOTcom.mp499.94MB

Lecture - 30 NP-Completeness - V-FreeVideoLecturesDOTcom.mp494.9MB

Lecture - 31 NP-Completeness - VI-FreeVideoLecturesDOTcom.mp488.2MB

Lecture - 13 Greedy Algorithms - IV-FreeVideoLecturesDOTcom.mp481.4MB