Old News
old news
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)
Jun-Jul 22: Workshop Complexity Theory with a human face (Czech Academy of Sciences, Prague)
Mar22. Paper published on Theoretical Computer Science: Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography. With Fariba Ranjbar
Jan22. Paper accepted to STACS 22. Depth lower bounds in Stabbing Planes for combinatorial principles. With S. Dantchev, A. Ghani, B. Martin.