| dc.contributor.advisor | Williams, Virginia Vassilevska | |
| dc.contributor.author | Mao, Xiao | |
| dc.date.accessioned | 2023-01-19T19:54:18Z | |
| dc.date.available | 2023-01-19T19:54:18Z | |
| dc.date.issued | 2022-09 | |
| dc.date.submitted | 2022-09-16T20:24:44.144Z | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/147497 | |
| dc.description.abstract | Since the term was coined by Richard Bellman in the 1940s, Dynamic Programming (DP) has remained one of the most popular technique in theoretical computer science, and has found applications in a wide range of problems.
In this thesis, I summarize my three recent works covering applications of DP to three fundamental problems in fine-grained complexity. The first application is a sub-cubic time algorithm for unweighted tree edit distance (TED), the second application is an improved FPTAS (Fully Polynomial-Time Approximation Scheme) for Partition, and the third application is an improved FPTAS for Knapsack. | |
| dc.publisher | Massachusetts Institute of Technology | |
| dc.rights | In Copyright - Educational Use Permitted | |
| dc.rights | Copyright MIT | |
| dc.rights.uri | http://rightsstatements.org/page/InC-EDU/1.0/ | |
| dc.title | Dynamic Programming meets Fine-grained Complexity | |
| dc.type | Thesis | |
| dc.description.degree | M.Eng. | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| mit.thesis.degree | Master | |
| thesis.degree.name | Master of Engineering in Electrical Engineering and Computer Science | |
