Mark Chen

Teaching-Related Experiences

Duties include holding weekly office hourse, grading, and occasionally making homework or exam questions.

Introduction to Computational Complexity (COMS 4236) taught by Henry Yuen (Fall 2023).
Analysis of Algorithms (COMS 4231) taught by Tim Roughgarden (Fall 2023).

(Spring 2024) Quantum Complexity Theory (co-organized a semester-long weekly seminar given by a graduate student with Columbia Undergraduate Learning Seminar in Theoretical Computer Science): homepage.
(Columbia Math Directed Reading Program)

(Spring 2024) Quantum Complexity Theory: talk 1 on definitions and overview, talk 6 on QMA and Local Hamiltonian Problems (Co-Presented with Andrew Yang).
(Spring 2024) Cryptography \(\cap\) TFNP:
- Presentation (co-presented with Akshat Yaparla) about the BPR paper "The Journey from NP to TFNP Hardness".
- Presentation (as the presenter, with support from Yizhi Huang) about the BPR paper "On the Cryptographic Hardness of Finding Nash Equilibrium".
(Spring 2024) Quantum Information Theory: A two-hour talk from different levels of interactive proof systems to quantum cryptography.

(Spring 2024) COMS 6998 Unconditional Lower Bounds and Derandomization: week 5 on Håstad's Switching Lemma & \(\mathbb{F}_2\) Polynomials, week 8 on Fourier Analysis on Boolean Functions, Sandwiching Approximator & Viola's Theorem.
(Spring 2024) MATH 3952 Undergraduate Math Seminar (on Quantum Information Theory): full scribe notes.