算法设计与分析
- 教程
 - 2025-03-03
 - 150
 
【资源目录】:
├──1.[1.1.1]–Introduction.mp4 36.44M
 ├──10.[3.4.1]–ConnectivityinDirectedGraphs.mp4 30.69M
 ├──11.[3.5.1]–DAGandTopologicalOrdering.mp4 59.61M
 ├──12.[4.1.1]–CoinChanging.mp4 41.69M
 ├──13.[4.2.1]–IntervalScheduling.mp4 45.11M
 ├──14.[4.3.1]–IntervalPartitioning.mp4 24.78M
 ├──15.[4.4.1]–SchedulingtoMinimizeLateness.mp4 46.34M
 ├──16.[4.5.1]–OptimalCaching.mp4 70.32M
 ├──17.[4.6.1]–ShortestPathsinaGraph.mp4 51.17M
 ├──18.[4.7.1]–MinimumSpanningTree.mp4 40.87M
 ├──19.[4.8.1]–CorrectnessofAlgorithms.mp4 38.63M
 ├──2.[1.3.1]–Gale-ShapleyAlgorithm.mp4 42.75M
 ├──20.[4.9.1]–Clustering.mp4 35.60M
 ├──21.[5.1.1]–Mergesort.mp4 74.80M
 ├──22.[5.2.1]–CountingInversions.mp4 52.43M
 ├──23.[5.3.1]–ClosestPairofPoints.mp4 58.18M
 ├──24.[5.4.1]–IntegerMultiplication.mp4 31.72M
 ├──25.[5.5.1]–5.5MatrixMultiplication.mp4 43.03M
 ├──26.[5.6.1]–ConvolutionandFFT.mp4 56.82M
 ├──27.[5.7.1]–FFT.mp4 39.18M
 ├──28.[5.8.1]–InverseDFT.mp4 35.46M
 ├──29.[6.1.1]–WeightedIntervalScheduling.mp4 79.94M
 ├──3.[1.4.1]–UnderstandingGale-ShapleyAlgo.mp4 50.17M
 ├──30.[6.2.1]–SegmentedLeastSquares.mp4 38.08M
 ├──31.[6.3.1]–KnapsackProblem.mp4 54.66M
 ├──32.[6.4.1]–RNASecondaryStructure.mp4 66.79M
 ├──33.[6.5.1]–SequenceAlignment.mp4 48.06M
 ├──34.[6.6.1]–ShortestPaths.mp4 43.39M
 ├──35.[7.1.1]–FlowsandCuts.mp4 18.04M
 ├──36.[7.2.1]–MinimumCutandMaximumFlow.mp4 34.05M
 ├──37.[7.3.1]–Ford-FulkersonAlgorithm.mp4 65.16M
 ├──38.[7.4.1]–ChoosingGoodAugmentingPaths.mp4 57.28M
 ├──39.[7.5.1]–BipartiteMatching.mp4 45.23M
 ├──4.[2.1.1]–ComputationalTractability.mp4 29.94M
 ├──40.[8.1.1]–Polynomial-TimeReductions.mp4 46.22M
 ├──41.[8.2.1]–BasicReductionStrategiesI.mp4 47.38M
 ├──42.[8.3.1]–BasicReductionStrategiesII.mp4 58.00M
 ├──43.[8.4.1]–DefinitionofNP.mp4 40.73M
 ├──44.[8.5.1]–ProblemsinNP.mp4 49.99M
 ├──45.[8.6.1]–NP-Completeness.mp4 42.67M
 ├──46.[8.7.1]–SequencingProblems.mp4 76.06M
 ├──47.[8.8.1]–NumericalProblems.mp4 57.05M
 ├──48.[8.9.1]–co-NPandtheAsymmetryofNP.mp4 23.74M
 ├──49.[9.1.1]–LoadBalancing.mp4 87.36M
 ├──5.[2.2.1]–AsymptoticOrderofGrowth.mp4 35.10M
 ├──50.[9.2.1]–CenterSelection.mp4 57.89M
 ├──51.[9.3.1]–ThePricingMethodVertexCover.mp4 44.81M
 ├──52.[9.4.1]–LPRoundingVertexCover.mp4 49.50M
 ├──53.[9.5.1]–KnapsackProblem.mp4 93.32M
 ├──54.[10.1.1]–LandscapeofanOptimizationPr.mp4 27.86M
 ├──55.[10.2.1]–MaximumCut.mp4 51.34M
 ├──56.[10.3.1]–NashEquilibria.mp4 41.82M
 ├──57.[10.4.1]–PriceofStability.mp4 60.03M
 ├──58.[11.1.1]–ContentionResolution.mp4 50.63M
 ├──59.[11.2.1]–LinearityofExpectation.mp4 40.07M
 ├──6.[2.3.1]–ASurveyofCommonRunningTimes.mp4 46.71M
 ├──60.[11.3.1]–MAX3-SAT.mp4 50.85M
 ├──61.[11.4.1]–ChernoffBounds.mp4 37.84M
 ├──7.[3.1.1]–BasicDefinitionsandApplicatio.mp4 54.83M
 ├──8.[3.2.1]–GraphTraversal.mp4 33.68M
 └──9.[3.3.1]–TestingBipartiteness.mp4 31.15M
会员资源
会员用户免费查看此资源升级会员
本文由Miracle于2025-03-03发表在遇见未来,如有疑问,请联系我们。
本文链接:https://www.cluxz.com/post/768.html
发表评论