Complexity Network: In-person meeting

Location: Teaching Room CS1.04 & CS1.05, Department of Computer Science, University of Warwick.

How to get here? Take a train to Coventry or Leamington Spa, then a bus/taxi/Uber to campus. More information is available here.

Preliminary Program: 

9:45  Gathering and Coffee + Brief Introduction of Participants (CS1.05) 

10:15 Open Problems Session (CS1.04)

11:00 Invited Talk (CS1.04) 

• Noel Arteche – The Proof Analysis Problem 

12:00  Talk 1 (CS1.04) 

• Jinqiao Hu – Meta-Complexity of Nondeterministic Kolmogorov Complexity 

12:30  Lunch (CS1.05) 

14:00  Interlude – DIMAP Seminar (MB0.07) 

• Iddo Tzameret – Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets 

15:00 Mini Break – Moving to CS1.04 

15:10  Talk 2 (CS1.04)  

• Ondřej Ježil – Prime Factorization in Models of PV1

15:40 Talk 3 (CS1.04) 

• Hanlin Ren – Hardness of Range Avoidance and Proof Complexity Generators from Demi-bits

16:10  Coffee & Cake (CS1.05) 

16:45 Talk 4 (CS1.04) 

• Erfan Khaniki – What is Incompleteness in the Finite Domain?

17:15  End of meeting