filmov
tv
Algorithms for NP-Hard Problems (Section 23.2: Decision, Search, and Optimization)
Показать описание
Before defining the set of “problems solvable by naive exhaustive search”—the complexity class NP—let’s step back and categorize the different types of input-output formats we’ve seen for computational problems.
0:10:05
Algorithms for NP-Hard Problems (Section 19.0: Overview and Prerequisites)
0:07:37
Algorithms for NP-Hard Problems (Section 23.2: Decision, Search, and Optimization)
0:16:19
Algorithms for NP-Hard Problems (Section 19.1: The Algorithmic Mystery of MST vs. TSP)
0:24:58
Algorithms for NP-Hard Problems (Section 23.3: NP: Problems with Easily Recognized Solutions)
0:26:07
Algorithm for NP-Hard Problems (Section 19.5: A Simple Recipe for Proving NP-Hardness)
0:09:53
Algorithms for NP-Hard Problems (Section 19.6: Rookie Mistakes)
0:06:12
Algorithms for NP-Hard Problems (Section 24.5: The Final Outcome)
0:24:40
Algorithms for NP-Hard Problems (Section 19.4: Algorithmic Strategies for NP-Hard Problems)
0:26:25
Algorithms for NP-Hard Problems (Section 22.5: Directed Hamiltonian Path Is NP-Hard)
0:12:45
Algorithms for NP-Hard Problems (Section 20.4: The 2-OPT Heuristic for the TSP) [Part 1 of 2]
0:12:05
Algorithms for NP-Hard Problems (Section 23.4: The P!=NP Conjecture)
0:19:18
Algorithms for NP-Hard Problems (Section 23.6: NP-Completeness)
0:25:07
Algorithms for NP-Hard Problems (Section 22.3: The Big Picture)
0:17:19
Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 1/2]
0:11:12
Algorithms for NP-Hard Problems (Section 23.1: Amassing Evidence of Intractability)
0:09:23
Algorithms for NP-Hard Problems (Section 22.1: Reductions Revisited)
0:19:35
Algorithms for NP-Hard Problems (Section 21.1: The Bellman-Held-Karp Algorithm for TSP) [Part 1/2]
0:08:24
Algorithms for NP-Hard Problems (Section 21.3: Problem-Specific Algorithms vs. Magic Boxes)
0:20:10
Algorithms for NP-Hard Problems (Section 20.2: A Greedy Heuristic for Maximum Coverage) [Part 1/2]
0:31:53
8. NP-Hard and NP-Complete Problems
0:24:27
Algorithms for NP-Hard Problems (Section 21.5: Satisfiability Solvers)
0:26:25
Algorithms for NP-Hard Problems (Section 24.3: Feasibility Checking) [Pt 2/2]
0:23:12
Algorithms for NP-Hard Problems (Section 20.5: Principles of Local Search) [Part 1 of 2]
0:18:46
Algorithms for NP-Hard Problems (Section 23.5: The Exponential Time Hypothesis)
Комментарии