Calendar | Simons Institute for the Theory of Computing

Primary tabs

Mon	Tue	Wed	Thu	Fri	Sat	Sun
27	28	29	30	31	1	2

3	4	5	6	7	8	9
	Fine-Grained Complexity of Lattice Problems Huck Bennett, University of Michigan 10:00 am – 12:00 pm Annals of Scientific Storytelling Siobhan Roberts (Simons Institute Journalist In Residence) 2:15 pm – 3:30 pm		Correlation Intractability and Fiat-Shamir in the Standard Model: Part 1 Alex Lombardi, MIT 10:00 am – 12:00 pm
10	11	12	13	14	15	16
	Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle) Matthew Coudron (University of Waterloo) 4:00 pm – 5:00 pm		Correlation Intractability and Fiat-Shamir in the Standard Model: Part 2 Alex Lombardi, MIT 10:00 am – 12:00 pm
17	18	19	20	21	22	23
	Lattices: Geometry, Algorithms and Hardness Feb. 18 – Feb. 21, 2020	Quantum Cryptanalysis of Post-Quantum Cryptography Feb. 22 – Feb. 24, 2020 »
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials Robin Kothari (Microsoft Research) 4:00 pm – 5:00 pm
24	25	26	27	28	29	1
« Quantum Cryptanalysis of Post-Quantum Cryptography Feb. 22 – Feb. 24, 2020	Quantum Algorithms Feb. 25 – Feb. 28, 2020
				Reading Group on MIP* = RE and its Application to Connes' Embedding Problem 2:00 pm – 3:30 pm