Complexity Network: In-person meeting

We will meet in-person for a whole day of informal talks and discussions around computational complexity. The meeting is scheduled for Wednesday, December 10th, at the University of Oxford.

Food will arrive at 9am; feel free to arrive anytime before 10:30.

Location: LTB & Atrium, Wolfson building, Department of Computer Science, University of Oxford. 

Preliminary Program:

10:00--10:30:  Arrivals, breakfast and coffee (Atrium) [Food served from 9:00AM; doors open for earlier access]

10:30 -- 11:30: Open problems

11:30 -- 12:00: How to Construct Random Strings (Rahul Santhanam, Oxford)

12:00 -- 12:30: Efficient Adversaries (Ján Pich, Oxford)

12:30 -- 14:00: Lunch (Suggestion: Gloucester Green Outdoor Market)

14:00 -- 15:00: Distribution Verification, Cryptography, and Quantum Advantage (Matthew Gray, Oxford)

15:00 -- 15:30: Simplicial Complexes and BQL-completeness (Adam Wesołowski, Royal Holloway)

15:30 -- 16:30: Coffee break

16:30 -- 17:00: On the gradient of the coefficient of the characteristic polynomial (Christian Ikenmeyer, Warwick)

17:00 -- 17:30: Parallelism and Adaptivity in Student-Teacher witnessing (Ondřej Ježil, Warwick)