|
Rain Zimin Yang (杨子民)I am a first-year PhD student in the Theory of Computation group at Columbia University. I completed a BSc in Computer Science and Mathematics at the University of British Columbia, where I worked with Professor Daochen Wang. My research interests include computational complexity, query complexity, communication complexity, Boolean function analysis, and algorithms. I'm also broadly interested in automata theory, quantum computing and parallel algorithms. I competed in the ICPC World Finals in 2025, and will compete again in 2026. CV · Linkedin |
Rational degree is polynomially related to degree
Robin Kothari, Matt Kovacs-Deak, Daochen Wang, Rain Zimin Yang
To appear in IEEE Symposium on Foundations of Computer Science (FOCS), 2026.
We prove that \(\deg(f) \leq \widetilde{O}(\operatorname{rdeg}(f)^3)\)
for every Boolean function \(f\), resolving a 1994 open problem of
Nisan and Szegedy attributed to Fortnow.
I'll mainly write about some papers I read, and talk about solutions to selected competitive programming problems I solved (listed in reverse chronological order).