Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
On the maximal part in unrefinable partitions of triangular numbersAragona, Riccardo ; Campioni, Lorenzo ; Civino, Roberto ; Lauria, MassimoAequationes mathematicae, 2022-12, Vol.96 (6), p.1339-1363 [Periódico revisado por pares]Cham: Springer International PublishingTexto completo disponível |
|
2 |
Material Type: Artigo
|
Upper bounds on positional Paris–Harrington gamesCarlucci, Lorenzo ; Lauria, MassimoDiscrete mathematics, 2021-03, Vol.344 (3), p.112257, Article 112257 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
Tight Size-Degree Bounds for Sums-of-Squares ProofsLauria, Massimo ; Nordström, JakobComputational complexity, 2017-12, Vol.26 (4), p.911-948 [Periódico revisado por pares]Cham: Springer International PublishingTexto completo disponível |
|
4 |
Material Type: Artigo
|
Clique Is Hard on Average for Regular ResolutionAtserias, Albert ; Bonacina, Ilario ; De Rezende, Susanna F. ; Lauria, Massimo ; Nordström, Jakob ; Razborov, AlexanderJournal of the ACM, 2021-08, Vol.68 (4), p.1-26 [Periódico revisado por pares]New York: Association for Computing MachineryTexto completo disponível |
|
5 |
Material Type: Artigo
|
On the Automatizability of Polynomial CalculusGalesi, Nicola ; Lauria, MassimoTheory of computing systems, 2010-08, Vol.47 (2), p.491-506 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
|
6 |
Material Type: Artigo
|
Space Complexity in Polynomial CalculusFilmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ; Ron-Zewi, Noga ; Thapen, NeilSIAM journal on computing, 2015-01, Vol.44 (4), p.1119-1153 [Periódico revisado por pares]Sem texto completo |
|
7 |
Material Type: Artigo
|
The complexity of proving that a graph is RamseyLauria, Massimo ; Pudlák, Pavel ; Rödl, Vojtěch ; Thapen, NeilCombinatorica (Budapest. 1981), 2017-04, Vol.37 (2), p.253-268 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
8 |
Material Type: Artigo
|
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer gamesBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, MassimoInformation processing letters, 2010-11, Vol.110 (23), p.1074-1077 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
Minimum-Energy Broadcast and disk cover in grid wireless networksCalamoneri, Tiziana ; Clementi, Andrea E.F. ; Di Ianni, Miriam ; Lauria, Massimo ; Monti, Angelo ; Silvestri, RiccardoTheoretical computer science, 2008-06, Vol.399 (1), p.38-53 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
On the bounded-hop MST problem on random Euclidean instancesClementi, Andrea E.F. ; Di Ianni, Miriam ; Lauria, Massimo ; Monti, Angelo ; Rossi, Gianluca ; Silvestri, RiccardoTheoretical computer science, 2007-10, Vol.384 (2), p.161-167 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |