Lauria, Massimo

1. Narrow Proofs May Be Maximally Long
   2014/09/09 by Atserias, Albert, Lauria, Massimo, Nordström, Jakob · 1 citation
   #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
2. On the maximal part in unrefinable partitions of triangular numbers
   2021/11/22 by Aragona, Riccardo, Campioni, Lorenzo, Civino, Roberto +1 · 1 citation
   #05A17 #05A19 #11P81 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)
3. Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases
   2023/05/31 by Lauria, Massimo, Nordström, Jakob · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences
4. Hardness of Approximation in PSPACE and Separation Results for Pebble Games
   2023/05/30 by Chan, Siu Man, Lauria, Massimo, Nordström, Jakob +1 · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences