RNDr. Marko Genyk-Berezovskyj: Algorithms [11, LS 18-19] - Mediasource - Czech technical university in Prague

You are here

Dynamic programming - Knapsack o/1 and unlimited problem, matrix chain multiplication, longest common subsequence.

Date:

2019/05/02

Source:

CTU in Prague, Faculty of Electrical Engineering

Type:

Educational

Division:

Faculty of Electrical Engineering