Heda Chen

 

Hi there, welcome to my homepage!

I am a first-year Ph.D. student studying theoretical computer science (TCS) at the University of Toronto, where I am very fortunate to be supervised by Roei Tell to work on exciting problems in complexity theory. Previously, I obtained my B.Eng. in Computer Science at Shanghai Jiao Tong University.

My current research interest lies in Structural Complexity Theory:

• Pseudorandomness and Derandomization.
• Meta-Complexity. Meta-complexity problems are those themselves asking complexities (of concrete problems), e.g., MCSP (Minimum Circuit Size Problem), MKtP (Minimum time-bounded Kolmogorov Complexity Problem). In this field, people study and characterize complexity classes using the complexity of meta-complexity problems.

Email: [firstname + lastname] [at] $\mathrm{cs}$ [dot] $\mathrm{toronto}$ [dot] $\mathrm{edu}$

University of Toronto
Term	Role	Course Code	Title
2025 Winter	TA	CSC240H1 S	Enriched Introduction to the Theory of Computation
Shanghai Jiao Tong University
Term	Role	Course Code	Title
2023 Fall	TA	CS3330	Combinatorics

• [Blog] My personal blog is here, including some expositions I've written and some random articles. You can also find some fun facts about me there.