Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
11 |
Material Type: Artigo
|
Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner BasesLauria, Massimo ; Nordström, JakobarXiv.org, 2023-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
12 |
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 |
|
13 |
Material Type: Artigo
|
Tight Size-Degree Bounds for Sums-of-Squares ProofsLauria, Massimo ; Nordström, JakobarXiv.org, 2015-04Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
14 |
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 |
|
15 |
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 |
|
16 |
Material Type: Artigo
|
From Small Space to Small Width in ResolutionFilmus, Yuval ; Lauria, Massimo ; Mikša, Mladen ; Nordström, Jakob ; Vinyals, MarcarXiv.org, 2014-09Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
|
17 |
Material Type: Artigo
|
The complexity of proving that a graph is RamseyLauria, Massimo ; Pudlák, Pavel ; Rödl, Vojtěch ; Thapen, NeilarXiv.org, 2013-03Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |