Computer Science/Discrete Mathematics

Date:
Apr
06
2026

Computer Science/Discrete Mathematics Seminar I

Bounded Arithmetic Meets Probability, and Applications in Cryptography
Jiatu Li
11:00am|Simonyi Hall 101 and Remote Access

The development of set theory in the 20th century was like the invention of a "mathematical telescope", through which we can observe all kinds of infinite sets and their interactions. In quite the opposite direction, bounded arithmetic serves as a...

Apr
13
2026

Computer Science/Discrete Mathematics Seminar I

Catalytic Tree Evaluation from Matching Vectors
Seyoon Ragavan
11:00am|Simonyi Hall 101 and Remote Access

What is the relative computational power of time and space? Tree evaluation (TreeEval) has become a central problem in understanding this question, especially after its application by Williams (STOC 2025, IAS CSDM seminar 9/23/25) to prove a...