Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
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 |
|
2 |
Material Type: Artigo
|
A Characterization of Tree-Like Resolution SizeBeyersdorff, Olaf ; Galesi, Nicola ; Lauria, MassimoElectronic colloquium on computational complexity, 2012 (161)Texto completo disponível |
|
3 |
Material Type: Artigo
|
Space Complexity in Polynomial CalculusFilmus, Yuval ; Lauria, Massimo ; Nordström, Jakob ; Ron-Zewi, Noga ; Thapen, NeilElectronic colloquium on computational complexity, 2012 (132)Texto completo disponível |