算法设计与分析-清华大学
1.[1.1.1]--Introduction(Av96888262,P1).mp4 36.4 MB
10.[3.4.1]--ConnectivityinDirectedGraphs(Av96888262,P10).mp4 30.7 MB
11.[3.5.1]--DAGandTopologicalOrdering(Av96888262,P11).mp4 59.6 MB
12.[4.1.1]--CoinChanging(Av96888262,P12).mp4 41.7 MB
13.[4.2.1]--IntervalScheduling(Av96888262,P13).mp4 45.1 MB
14.[4.3.1]--IntervalPartitioning(Av96888262,P14).mp4 24.8 MB
15.[4.4.1]--SchedulingtoMinimizeLateness(Av96888262,P15).mp4 46.3 MB
16.[4.5.1]--OptimalCaching(Av96888262,P16).mp4 70.3 MB
17.[4.6.1]--ShortestPathsinaGraph(Av96888262,P17).mp4 51.4 MB
18.[4.7.1]--MinimumSpanningTree(Av96888262,P18).mp4 40.9 MB
19.[4.8.1]--CorrectnessofAlgorithms(Av96888262,P19).mp4 38.6 MB
2.[1.3.1]--Gale-ShapleyAlgorithm(Av96888262,P2).mp4 43.2 MB
20.[4.9.1]--Clustering(Av96888262,P20).mp4 35.6 MB
21.[5.1.1]--Mergesort(Av96888262,P21).mp4 74.8 MB
22.[5.2.1]--CountingInversions(Av96888262,P22).mp4 52.4 MB
23.[5.3.1]--ClosestPairofPoints(Av96888262,P23).mp4 58.2 MB
24.[5.4.1]--IntegerMultiplication(Av96888262,P24).mp4 31.7 MB
25.[5.5.1]--5.5MatrixMultiplication(Av96888262,P25).mp4 43.0 MB
26.[5.6.1]--ConvolutionandFFT(Av96888262,P26).mp4 56.8 MB
27.[5.7.1]--FFT(Av96888262,P27).mp4 39.5 MB
28.[5.8.1]--InverseDFT(Av96888262,P28).mp4 35.5 MB
29.[6.1.1]--WeightedIntervalScheduling(Av96888262,P29).mp4 79.9 MB
3.[1.4.1]--UnderstandingGale-ShapleyAlgo(Av96888262,P3).mp4 50.2 MB
30.[6.2.1]--SegmentedLeastSquares(Av96888262,P30).mp4 38.1 MB
31.[6.3.1]--KnapsackProblem(Av96888262,P31).mp4 54.7 MB
32.[6.4.1]--RNASecondaryStructure(Av96888262,P32).mp4 66.8 MB
33.[6.5.1]--SequenceAlignment(Av96888262,P33).mp4 48.1 MB
34.[6.6.1]--ShortestPaths(Av96888262,P34).mp4 43.4 MB
35.[7.1.1]--FlowsandCuts(Av96888262,P35).mp4 18.0 MB
36.[7.2.1]--MinimumCutandMaximumFlow(Av96888262,P36).mp4 34.0 MB
37.[7.3.1]--Ford-FulkersonAlgorithm(Av96888262,P37).mp4 65.2 MB
38.[7.4.1]--ChoosingGoodAugmentingPaths(Av96888262,P38).mp4 58.0 MB
39.[7.5.1]--BipartiteMatching(Av96888262,P39).mp4 45.2 MB
4.[2.1.1]--ComputationalTractability(Av96888262,P4).mp4 29.9 MB
40.[8.1.1]--Polynomial-TimeReductions(Av96888262,P40).mp4 46.2 MB
41.[8.2.1]--BasicReductionStrategiesI(Av96888262,P41).mp4 47.4 MB
42.[8.3.1]--BasicReductionStrategiesII(Av96888262,P42).mp4 58.0 MB
43.[8.4.1]--DefinitionofNP(Av96888262,P43).mp4 40.7 MB
44.[8.5.1]--ProblemsinNP(Av96888262,P44).mp4 51.3 MB
45.[8.6.1]--NP-Completeness(Av96888262,P45).mp4 42.7 MB
46.[8.7.1]--SequencingProblems(Av96888262,P46).mp4 76.1 MB
47.[8.8.1]--NumericalProblems(Av96888262,P47).mp4 57.0 MB
48.[8.9.1]--co-NPandtheAsymmetryofNP(Av96888262,P48).mp4 23.7 MB
49.[9.1.1]--LoadBalancing(Av96888262,P49).mp4 87.4 MB
5.[2.2.1]--AsymptoticOrderofGrowth(Av96888262,P5).mp4 35.1 MB
50.[9.2.1]--CenterSelection(Av96888262,P50).mp4 57.9 MB
51.[9.3.1]--ThePricingMethodVertexCover(Av96888262,P51).mp4 44.8 MB
52.[9.4.1]--LPRoundingVertexCover(Av96888262,P52).mp4 49.5 MB
53.[9.5.1]--KnapsackProblem(Av96888262,P53).mp4 93.3 MB
54.[10.1.1]--LandscapeofanOptimizationPr(Av96888262,P54).mp4 27.8 MB
55.[10.2.1]--MaximumCut(Av96888262,P55).mp4 51.3 MB
56.[10.3.1]--NashEquilibria(Av96888262,P56).mp4 42.5 MB
57.[10.4.1]--PriceofStability(Av96888262,P57).mp4 60.0 MB
58.[11.1.1]--ContentionResolution(Av96888262,P58).mp4 50.6 MB
59.[11.2.1]--LinearityofExpectation(Av96888262,P59).mp4 40.1 MB
6.[2.3.1]--ASurveyofCommonRunningTimes(Av96888262,P6).mp4 46.7 MB
60.[11.3.1]--MAX3-SAT(Av96888262,P60).mp4 50.8 MB
61.[11.4.1]--ChernoffBounds(Av96888262,P61).mp4 38.4 MB
7.[3.1.1]--BasicDefinitionsandApplicatio(Av96888262,P7).mp4 55.8 MB
8.[3.2.1]--GraphTraversal(Av96888262,P8).mp4 33.7 MB
9.[3.3.1]--TestingBipartiteness(Av96888262,P9).mp4 31.1 MB