Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
31 |
Material Type: Artigo
|
Strategies for the continuity of the historical city: the denied maintenance approachMassimo Lauria ; Maria AzzalinAgathón (Online), 2017-06, Vol.1 (online) [Periódico revisado por pares]Palermo University PressTexto completo disponível |
|
32 |
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 |
|
33 |
Material Type: Artigo
|
Optimality of size-degree tradeoffs for polynomial calculusGalesi, Nicola ; Lauria, MassimoACM transactions on computational logic, 2010-10, Vol.12 (1), p.1-22 [Periódico revisado por pares]ACMTexto completo disponível |
|
34 |
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 |
|
35 |
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 |
|
36 |
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 |
|
37 |
Material Type: Artigo
|
A rank lower bound for cutting planes proofs of Ramsey TheoremLauria, MassimoElectronic colloquium on computational complexity, 2012 (124)Texto completo disponível |
|
38 |
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 |
|
39 |
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 |
|
40 |
Material Type: Artigo
|
A characterization of tree-like Resolution sizeBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, MassimoInsurance, mathematics & economics, 2013-09, Vol.113 (18), p.666 [Periódico revisado por pares]Amsterdam: Elsevier Sequoia S.ATexto completo disponível |