old news

2024

28 Nov 24: LoC3 Seminar:  Mauro di Nasso: Arithmetic Ramsey Theory, a nonstandard take. 

Sep 24.   From 2 to 6 Sep I'll be at the Worksh op  "Proof Complexity 24" In Oxford. 

Aug 24. Paper  "The complexity of Boolean  failure identification"  accepted to ICTCS 24. With F. Ranjbar 

Jun 24.  Workshop RaTLoCC IV in Pisa: "Ramsey Theory in Logic Complexity and Combinatorics".  (Registration here ) 

Mar 24. Oberwolfach Workshop "Proof Complexity and Beyond" . 

2023

Dec 23. Opening  for a 18 months postdoc position. Deadline 19 Jan 2024 (apply or write me an email) 

Sep 23.  PRIN project: Logical Methods in combinatorics. With Milano-Statale, Pisa, Torino. 

Jul 23.  Paper  "The algebraic proof complexity of Tensor Isomorphism " accepted to Conference on Computational Complexity 23. Written with. Joshua Grochow, Toni Pitassi, Adrian She.    

Jul 23. Workshop:  Logical methods in Ramsey Theory and relted topics. Pisa July 8-11 2023 

May 23. Graduate course on Foundations of SAT-solving  in Sapienza.

2022

Nov22.  New seminar series in Sapienza.  Sapienza LOC3 (Logic,  Complexity, Combinatorics, Computability)

Nov 22.   PC member in the conference CIAC 2023 (International Symposium on Algorithms and Complexity)

Sep 22.  Paper accepted to Mathematical Foundations of Computer Science (MFCS 22). On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. With I. Bonacina and M.Lauria

Jul 22.  Paper accepted to Annals of Pure and Applied Logic.  Bounded-depth Frege complexity of Tseitin formulas for all graphs. With D. Itsykson, A.Riazanov, A Sofronova.

Jun-Jul 22.  Logic Colloquium 2022. I co-organized the special session in Computer Science Logic. 

Jul 22:  Workshop Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation. (International Centre for Mathematical Sciences, Edinburgh)