( en | de | ru )

 

Disambiguation of "Galesi, Nicola"

Author of the publication

copydeleteadd this publication to your clipboard
Paris-Harrington Tautologies.

, , and . CCC, page 93-103. IEEE Computer Society, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicola Galabaroff

Rudolf Nicola

Nicola Gess

Ernesto Nicola

Nicola Neuvians

 

Other publications of authors with the same name

Optimality of size-width tradeoffs for resolution., and . Comput. Complex., 10 (4): 261-276 (2001)Vertex-connectivity for node failure identification in Boolean Network Tomography., , and . Inf. Process. Lett., (February 2024)On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies., , and . ACM Trans. Comput. Log., 17 (4): 26 (2016)Space proof complexity for random 3-CNFs., , , , , and . Inf. Comput., (2017)Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography., and . Theor. Comput. Sci., (2022)Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography., and . ICDCS, page 212-222. IEEE Computer Society, (2018)Cops-Robber Games and the Resolution of Tseitin Formulas., , and . SAT, volume 10929 of Lecture Notes in Computer Science, page 311-326. Springer, (2018)Paris-Harrington Tautologies., , and . CCC, page 93-103. IEEE Computer Society, (2011)On the Complexity of Resolution with Bounded Conjunctions., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 220-231. Springer, (2002)Resolution and the Binary Encoding of Combinatorial Principles., , and . CCC, volume 137 of LIPIcs, page 6:1-6:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)