ACM Tech Talk: Dynamic Programming

Wednesday, May 2nd at 3:15 pm.  E&T A331

In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems exhibiting the properties of overlapping subproblems which are only slightly smaller and optimal substructure. When applicable, the method takes far less time than naive methods.

Please join ACM as we explore this exciting topic in computer science used to solve complex problems. Refreshment will be served.