Course project of Research Immersion Training, 2022
This project is mainly about SNARG constructions using Fiat-Shamir in recent years. We make some attempts to generalize some techniques used in the constructions.
See the report here
Course project of Computational Biology, 2022
This project is about the hardness of sequence alignment, a fundamental problem in computational biology. We show that the online version of this problem is hard assuming Orthogonal Vectors Conjecture.
See the report here
Course project of Game Theory, 2021
This is a survey focusing mainly on PPAD, the complexity class capturing the hardness of computing Nash equilibria.
See the report here
Course project of Design and Analysis of Algorithms, 2021
This is a survey on Dynamic Optimality, the problem of finding the optimal binary search tree.
See the report here