Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Cliques enumeration and tree-like resolution proofsLauria, MassimoInformation processing letters, 2018-07, Vol.135, p.62-67 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
2 |
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 |
3 |
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 |