Past Program Activities

Daily Tea
May 15, 2020
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification
Speaker: Aayush Jain (UCLA)
May 14, 2020
Program: Lattices: Algorithms, Complexity, and Cryptography
Daily Tea
May 14, 2020
Daily Tea
May 13, 2020
Daily Tea
May 12, 2020
Quantum Linear Algebra With Near-Optimal Complexities
Speaker: Lin Lin (UC Berkeley)
May 12, 2020
Program: The Quantum Wave in Computing
Daily Tea
May 11, 2020
Reading Group on MIP* = RE and its Application to Connes' Embedding Problem
May 8, 2020
Daily Tea
May 8, 2020
Daily Tea
May 7, 2020

Pages