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 Thursday, March 14th, at the University of Oxford. Lunch and coffee will be provided.

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

Preliminary Program:

10:00  Gathering and coffee (Atrium)

10:30  Talk 1 (LTA)

• Svyatoslav Gryaznov - Bounded depth Frege lower bounds for random 3-CNFs via deterministic restrictions

12:00  Lunch (Atrium)

14:00  Talk 2 (LTA) 

• Michal Garlik - Lower bounds for regular resolution over parities

15:05  Talk 3 (LTA) 

• Iddo Tzameret - Functional lower bounds for algebraic proofs: symmetry, lifting, and barriers

15:45  Coffee break (Atrium)

16:10  Talk 4 (LTA) 

• Ian Mertz - The tree evaluation problem: context and recent results

16:45  Talk 5 (LTA) 

• Antonio Grassi - Neuro-Inspired algorithms to overcome sample complexity challenges in reinforced learning

17:20  Talk 6 (LTA) 

• Gregory Rosenthal -  Rethinking conference awards

17:30  End of meeting