Travelled to:1 × Finland
1 × Latvia
1 × Switzerland
1 × USA
Collaborated with:O.Beyersdorff N.Galesi ∅ P.Pudlák V.Rödl N.Thapen A.A.Razborov Y.Filmus M.Miksa J.Nordström M.Vinyals
Talks about:bound (3) parameter (2) complex (2) ramsey (2) lower (2) understand (1) procedur (1) polynomi (1) calculus (1) theorem (1)
Person: Massimo Lauria
DBLP: Lauria:Massimo
Contributed to:
2013
201320112011Wrote 5 papers:
- ICALP-v1-2013-FilmusLMNV #bound #calculus #comprehension #polynomial #towards
- Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (YF, ML, MM, JN, MV), pp. 437–448.
- ICALP-v1-2013-LauriaPRT #complexity #graph #proving
- The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
- SAT-2013-Lauria #bound #proving #rank #theorem
- A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.
- ICALP-v1-2011-BeyersdorffGLR #bound
- Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.
- SAT-2011-BeyersdorffGL #complexity
- Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.