算法设计与分析 - 清华大学|9.3.3.1TestingBipartitenessAv96888262P9

算法设计与分析 - 清华大学

9.3.3.1--TestingBipartitenessAv96888262P9.mp4 31.1MB

8.3.2.1--GraphTraversalAv96888262P8.mp4 33.7MB

7.3.1.1--BasicDefinitionsandApplicatioAv96888262P7.mp4 55.8MB

61.11.4.1--ChernoffBoundsAv96888262P61.mp4 38.4MB

60.11.3.1--MAX3-SATAv96888262P60.mp4 50.8MB

6.2.3.1--ASurveyofCommonRunningTimesAv96888262P6.mp4 46.7MB

59.11.2.1--LinearityofExpectationAv96888262P59.mp4 40.1MB

58.11.1.1--ContentionResolutionAv96888262P58.mp4 50.6MB

57.10.4.1--PriceofStabilityAv96888262P57.mp4 60.0MB

56.10.3.1--NashEquilibriaAv96888262P56.mp4 42.5MB

55.10.2.1--MaximumCutAv96888262P55.mp4 51.3MB

54.10.1.1--LandscapeofanOptimizationPrAv96888262P54.mp4 27.9MB

53.9.5.1--KnapsackProblemAv96888262P53.mp4 93.3MB

52.9.4.1--LPRoundingVertexCoverAv96888262P52.mp4 49.5MB

51.9.3.1--ThePricingMethodVertexCoverAv96888262P51.mp4 44.8MB

50.9.2.1--CenterSelectionAv96888262P50.mp4 57.9MB

5.2.2.1--AsymptoticOrderofGrowthAv96888262P5.mp4 35.1MB

49.9.1.1--LoadBalancingAv96888262P49.mp4 87.4MB

48.8.9.1--co-NPandtheAsymmetryofNPAv96888262P48.mp4 23.7MB

47.8.8.1--NumericalProblemsAv96888262P47.mp4 57.1MB

46.8.7.1--SequencingProblemsAv96888262P46.mp4 76.1MB

45.8.6.1--NP-CompletenessAv96888262P45.mp4 42.7MB

44.8.5.1--ProblemsinNPAv96888262P44.mp4 51.3MB

43.8.4.1--DefinitionofNPAv96888262P43.mp4 40.7MB

42.8.3.1--BasicReductionStrategiesIIAv96888262P42.mp4 58.0MB

41.8.2.1--BasicReductionStrategiesIAv96888262P41.mp4 47.4MB

40.8.1.1--Polynomial-TimeReductionsAv96888262P40.mp4 46.2MB

4.2.1.1--ComputationalTractabilityAv96888262P4.mp4 29.9MB

39.7.5.1--BipartiteMatchingAv96888262P39.mp4 45.2MB

38.7.4.1--ChoosingGoodAugmentingPathsAv96888262P38.mp4 58.0MB

37.7.3.1--Ford-FulkersonAlgorithmAv96888262P37.mp4 65.2MB

36.7.2.1--MinimumCutandMaximumFlowAv96888262P36.mp4 34.1MB

35.7.1.1--FlowsandCutsAv96888262P35.mp4 18.0MB

34.6.6.1--ShortestPathsAv96888262P34.mp4 43.4MB

33.6.5.1--SequenceAlignmentAv96888262P33.mp4 48.1MB

32.6.4.1--RNASecondaryStructureAv96888262P32.mp4 66.8MB

31.6.3.1--KnapsackProblemAv96888262P31.mp4 54.7MB

30.6.2.1--SegmentedLeastSquaresAv96888262P30.mp4 38.1MB

3.1.4.1--UnderstandingGale-ShapleyAlgoAv96888262P3.mp4 50.2MB

29.6.1.1--WeightedIntervalSchedulingAv96888262P29.mp4 79.9MB

28.5.8.1--InverseDFTAv96888262P28.mp4 35.5MB

27.5.7.1--FFTAv96888262P27.mp4 39.5MB

26.5.6.1--ConvolutionandFFTAv96888262P26.mp4 56.8MB

25.5.5.1-- 43.0MB

24.5.4.1--IntegerMultiplicationAv96888262P24.mp4 31.7MB

23.5.3.1--ClosestPairofPointsAv96888262P23.mp4 58.2MB

22.5.2.1--CountingInversionsAv96888262P22.mp4 52.4MB

21.5.1.1--MergesortAv96888262P21.mp4 74.8MB

20.4.9.1--ClusteringAv96888262P20.mp4 35.6MB

2.1.3.1--Gale-ShapleyAlgorithmAv96888262P2.mp4 43.2MB

19.4.8.1--CorrectnessofAlgorithmsAv96888262P19.mp4 38.6MB

18.4.7.1--MinimumSpanningTreeAv96888262P18.mp4 40.9MB

17.4.6.1--ShortestPathsinaGraphAv96888262P17.mp4 51.4MB

16.4.5.1--OptimalCachingAv96888262P16.mp4 70.3MB

15.4.4.1--SchedulingtoMinimizeLatenessAv96888262P15.mp4 46.3MB

14.4.3.1--IntervalPartitioningAv96888262P14.mp4 24.8MB

13.4.2.1--IntervalSchedulingAv96888262P13.mp4 45.1MB

12.4.1.1--CoinChangingAv96888262P12.mp4 41.7MB

11.3.5.1--DAGandTopologicalOrderingAv96888262P11.mp4 59.6MB

10.3.4.1--ConnectivityinDirectedGraphsAv96888262P10.mp4 30.7MB

1.1.1.1--IntroductionAv96888262P1.mp4 36.4MB