E-LIB Suche - Ergebnisse für: Galesi, Nicola

1

Vertex-connectivity for node failure identification in Bool..:

Galesi, Nicola ; Ranjbar, Fariba ; Zito, Michele
Information Processing Letters. 184 (2024) - p. 106450 , 2024

Link: https://doi.org/10.1016/..

2

Proof Complexity and the Binary Encoding of Combinatorial P..:

Dantchev, Stefan ; Galesi, Nicola ; Ghani, Abdul.
SIAM Journal on Computing. 53 (2024) 3 - p. 764-802 , 2024

Link: https://doi.org/10.1137/..

3

On vanishing sums of roots of unity in polynomial calculus ..:

Bonacina, Ilario ; Galesi, Nicola ; Lauria, Massimo
computational complexity. 32 (2023) 2 - p. , 2023

Link: https://doi.org/10.1007/..

4

Bounded-depth Frege complexity of Tseitin formulas for all ..:

Galesi, Nicola ; Itsykson, Dmitry ; Riazanov, Artur.
Annals of Pure and Applied Logic. 174 (2023) 1 - p. 103166 , 2023

Link: https://doi.org/10.1016/..

5

Tight bounds to localize failure nodes on trees, grids and ..:

Galesi, Nicola ; Ranjbar, Fariba
Theoretical Computer Science. 919 (2022) - p. 103-117 , 2022

Link: https://doi.org/10.1016/..

6

Cops-Robber Games and the Resolution of Tseitin Formulas:

Galesi, Nicola ; Talebanfard, Navid ; Torán, Jacobo
ACM Transactions on Computation Theory. 12 (2020) 2 - p. 1-22 , 2020

Link: https://doi.org/10.1145/..

7

Cops-Robber Games and the Resolution of Tseitin Formulas:

Galesi, Nicola ; Talebanfard, Navid ; Torán, Jacobo
ACM Transactions on Computation Theory (TOCT). 12 (2020) 2 - p. 1-22 , 2020

Link: https://dl.acm.org/doi/1..

8

Vertex-Connectivity for Node Failure Identification in Bool..:

, In: Algorithms for Sensor Systems; Lecture Notes in Computer Science,

Galesi, Nicola ; Ranjbar, Fariba ; Zito, Michele - p. 79-95 , 2019

Link: https://doi.org/10.1007/..

9

Polynomial Calculus Space and Resolution Width:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),

Galesi, Nicola ; Kolodziejczyk, Leszek ; Thapen, Neil - p. 1325-1337 , 2019

Link: https://doi.org/10.1109/..

10

Resolution and the binary encoding of combinatorial princip..:

, In: Proceedings of the 34th Computational Complexity Conference,

Dantchev, Stefan ; Galesi, Nicola ; Martin, Barnaby - p. 1-25 , 2019

Link: https://dl.acm.org/doi/1..

11

Space proof complexity for random 3-CNFs:

Bennett, Patrick ; Bonacina, Ilario ; Galesi, Nicola...
Information and Computation. 255 (2017) - p. 165-176 , 2017

Link: https://doi.org/10.1016/..

12

On the Proof Complexity of Paris-Harrington and Off-Diagona..:

Carlucci, Lorenzo ; Galesi, Nicola ; Lauria, Massimo
ACM Transactions on Computational Logic. 17 (2016) 4 - p. 1-25 , 2016

Link: https://doi.org/10.1145/..

13

On the Proof Complexity of Paris-Harrington and Off-Diagona..:

Carlucci, Lorenzo ; Galesi, Nicola ; Lauria, Massimo
ACM Transactions on Computational Logic (TOCL). 17 (2016) 4 - p. 1-25 , 2016

Link: https://dl.acm.org/doi/1..

14

Total Space in Resolution:

Bonacina, Ilario ; Galesi, Nicola ; Thapen, Neil
SIAM Journal on Computing. 45 (2016) 5 - p. 1894-1909 , 2016

Link: https://doi.org/10.1137/..

15

A Framework for Space Complexity in Algebraic Proof Systems:

Bonacina, Ilario ; Galesi, Nicola
Journal of the ACM. 62 (2015) 3 - p. 1-20 , 2015

Link: https://doi.org/10.1145/..