2026-09-18T21:20:05Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1474972023-01-20T03:35:53Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Williams, Virginia Vassilevska
Mao, Xiao
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-01-19T19:54:18Z
2023-01-19T19:54:18Z
2022-09
2022-09-16T20:24:44.144Z
https://hdl.handle.net/1721.1/147497
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.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright MIT
http://rightsstatements.org/page/InC-EDU/1.0/
Dynamic Programming meets Fine-grained Complexity
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="745852c4-a2cd-43a1-894e-6f17565c502e">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Dynamic Programming meets Fine-grained Complexity</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2022-09</PublicationDate>
<Authors>
<Author>
<DisplayName>Mao, Xiao</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://rightsstatements.org/page/InC-EDU/1.0/</License>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>