ConceptSystems & CS
Non-serial polyadic DP
A class of dynamic programming algorithms where computations in one phase depend on results from multiple previous phases, and recursive formulations involve more than one term on the right-hand side.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.