Lecture 14: Upper bounds on combinatorially distinct general gluings, bounded sharpness, dynamic-programming algorithm for enumerating gluings; Latin cross and square case studies; teabag problem.
These are rough, personal lecture notes handwritten by Erik Demaine used during lecture. Their primary purpose is for reading/review by students of the class. Accessibility
[<< prev lecture <<] -- [< prev page <] -- [> next page >] -- [>> next lecture >>] -- [up to index]