Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
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 |
|
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
|
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 |
|
4 |
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 |
|
5 |
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 |