Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Clique Is Hard on Average for Regular ResolutionAtserias, Albert ; Bonacina, Ilario ; de Rezende, Susanna F ; Lauria, Massimo ; Nordström, Jakob ; Razborov, AlexanderarXiv.org, 2020-12Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
2 |
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 |
|
3 |
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 |
|
4 |
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 |
|
5 |
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 |
|
6 |
Material Type: Artigo
|
A characterization of tree-like Resolution sizeBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, MassimoInformation processing letters, 2013-09, Vol.113 (18), p.666-671 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
Parameterized Complexity of DPLL Search ProceduresBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, MassimoACM transactions on computational logic, 2013-08, Vol.14 (3), p.1-21 [Periódico revisado por pares]ACMTexto completo disponível |
|
8 |
Material Type: Artigo
|
Parameterized Bounded-Depth Frege Is not OptimalBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, Massimo ; Razborov, Alexander AACM transactions on computation theory, 2012-09, Vol.4 (3), p.1-16 [Periódico revisado por pares]ACMTexto completo disponível |
|
9 |
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 |
|
10 |
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 |