Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
On vanishing sums of roots of unity in polynomial calculus and sum-of-squaresBonacina, Ilario ; Galesi, Nicola ; Lauria, MassimoComputational complexity, 2023-12, Vol.32 (2), Article 12 [Periódico revisado por pares]Cham: Springer International PublishingTexto completo disponível |
|
2 |
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 |
|
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
|
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 |
|
5 |
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 |