Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's TheoremLauria, MassimoACM transactions on computation theory, 2016-07, Vol.8 (4), p.1-13 [Periódico revisado por pares]ACMTexto completo disponível |
|
2 |
Material Type: Artigo
|
Narrow Proofs May Be Maximally LongAtserias, Albert ; Lauria, Massimo ; Nordström, JakobACM transactions on computational logic, 2016-07, Vol.17 (3), p.1-30 [Periódico revisado por pares]ACMTexto completo disponível |
|
3 |
Material Type: Artigo
|
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey TautologiesCarlucci, Lorenzo ; Galesi, Nicola ; Lauria, MassimoACM transactions on computational logic, 2016-11, Vol.17 (4), p.1-25 [Periódico revisado por pares]ACMTexto completo disponível |
|
4 |
Material Type: Artigo
|
On the maximal part in unrefinable partitions of triangular numbersAragona, Riccardo ; Campioni, Lorenzo ; Civino, Roberto ; Lauria, MassimoarXiv.org, 2022-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
5 |
Material Type: Artigo
|
Narrow Proofs May Be Maximally LongAtserias, Albert ; Lauria, Massimo ; Nordström, JakobarXiv.org, 2014-09Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
6 |
Material Type: Artigo
|
From Small Space to Small Width in ResolutionFilmus, Yuval ; Lauria, Massimo ; Mikša, Mladen ; Nordström, Jakob ; Vinyals, MarcarXiv.org, 2014-09Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |