About Me

I am Heda Chen, an senior undergraduate@SJTU, ACM Honor Class 2020, looking for PhD in 2024.

I have a broad interest in Theoretical CS (especially Complexity Theory), Combinatorics (and also PL Theory).
You're welcome to contact me if you want to collaborate with me on these topics.
Currently I am working on

  • Polynomial modulo degree of Boolean functions
  • Algorithmic hardness of discrepancy by topological complexity barriers
  • Approximate Counting Independent Sets

Ironically, the topics I am particularly interested in are the elegant structural results in computational complexity, which seems to be far away from (most of) what I am currently working on. The problems in this subfield have been extensively studied, making the remaining open problems very challenging for me to start up as an undergraduate, especially in the condition that I have been unable to find a researcher who is willing to collaborate with me on these problems.

I enjoy understanding and exploring the essence of various proofs (or even more general things), finding intuitive explanations, and writing them down in an easy-to-understand manner.
Currently, writing posts is too time-consuming for me. It usually takes at least one week to grasp the essential idea, organize my thoughts, and make the post coherent and fluent. However, I believe that one day I will be able to do it faster and better.