Jan Verschelde
- 28:02
- 2 ай бұрын
the traveling salesman problem is NP-complete
- 40:56
- 2 ай бұрын
the Hamiltonian cycle problem is NP-complete
- 43:22
- 2 ай бұрын
circuit satisfiability is NP-complete
- 31:54
- 2 ай бұрын
certification and NP-completeness
- 29:40
- 2 ай бұрын
the 3-satisfiability problem is polynomial-time reducible to the independent set problem
- 48:27
- 2 ай бұрын
polynomial-time reductions of independent set and vertex cover, generalizations to set cover
- 24:31
- 2 ай бұрын
airline scheduling solved by circulations with demands and lower bounds, via Ford-Fulkerson
- 37:39
- 2 ай бұрын
the edge-dispoint paths and survey design problems solved by the Ford-Fulkerson algorithm
- 34:26
- 2 ай бұрын
determining the feasibility of circulation with demands via the Ford-Fulkerson algorithm
- 47:39
- 2 ай бұрын
solving the bipartite matching problem with the Ford-Fulkerson algorithm to compute maximum flow
- 41:28
- 2 ай бұрын
optimality of the Ford-Fulkerson algorithm to compute the maximum flow and the minimal cut
- 29:21
- 2 ай бұрын
the Bellman-Ford algorithm to compute all shortest paths in a directed graph with negative weights
- 34:03
- 2 ай бұрын
sequence alignment of words of size m and n runs in time O(m*n) via dynamic programming
- 37:45
- 2 ай бұрын
the segmented least squares problems solved by dynamic programming in time cubic in the dimension
- 30:58
- 3 ай бұрын
principles of dynamic programming, from a memoized recursive to a direct iterative version
- 46:19
- 3 ай бұрын
weighted interval scheduling solved by dynamic programming
- 40:13
- 3 ай бұрын
the fast Fourier transform runs in quasilinear time
- 43:45
- 3 ай бұрын
Пікірлер