Dynamic Programming meets Fine-grained Complexity
Name
Mao-xiao_mao-meng-eecs-2022-thesis.pdf
Description
Thesis PDF
Size
671.76 KB
Format
Adobe PDF
Checksum (MD5)
358ca498b2819c76a28a7ea20495ea0b
Author(s)
Mao, Xiao
Advisor(s)
Williams, Virginia Vassilevska
Date Issued
September 2022
Publisher
Massachusetts Institute of Technology
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
