The copyrights
belongs to the publisher. All papers are preprints essentially
equivalent to the published versions, and can be only downloaded
for academic purposes.
Nicola Galesi, Fariba
Ranjbar Tight Bounds for Maximal Identifiability of Failure
Nodes in Boolean Network Tomography. IEEE Conference on
Distributed and Computing Systems (ICDCS 2018).
[23] Patrick Bennett, Ilario Bonacina,
Nicola Galesi, Tony Huynh, Mike Molloy, and Paul Wollan Space proof complexity for random 3-CNFs, Information and Computation
2017
[19] Olaf Beyersdorff, Nicola Galesi and
Massimo Lauria.
A characterization of tree-like Resolution size. Information Processing Letters 113(18): 666-671 (2013)
[17] Olaf Beyersdorff, Nicola Galesi and
Massimo Lauria, Alexander Razborov.
Parameterized Bounded-Depth Frege is not Optimal ACM Transactions on Computation Theory (TOCT). 4(3), pp.
2012.
[16] Olaf Beyersdorff, Nicola Galesi and
Massimo Lauria.
A Lower Bound for the Pigeonhole Principle in Tree-like
Resolution by Asymmetric Prover-Delayer Games Information Processing Letters. 110(23):1074-1077 2010
[13] J.Buresh-Oppenheim, Nicola Galesi,
A. Magen, T. Pitassi. S. Hoory. Rank Bounds and
Integrality Gaps for Cutting Planes Procedures . Theory
of Computing. 2(1) pp. 65–90, 2006.
[11] Nicola Galesi, O. Kullmann.
Polynomial SAT decision, hypergraph transversals and Hermitian
rank Selected Papers of SAT 04, Lecture Notes in Computer
Science 3542, pp. 89–104., 2005
[10] J.L Esteban, Nicola Galesi, J.
Messner.
On the Complexity of Resolution with Bounded Conjunctions. Theoretical
Computer Science. 21(2-3)pp. 347-370 2004
[9] E. Ben-Sasson, Nicola Galesi
Space Complexity for Random Formulae in Resolution. Random Structures and Algorithms, 2003. Vol 23(1). 2003
pp.92-109.
[8] A. Atserias, Nicola Galesi, P.
Pudlàk.
Monotone Simulations of nonmonotone Propositional Proofs. Journal of Computer and System Science. 65(4): 626-638
(2002)
[4] M. L. Bonet, J.L. Esteban, Nicola
Galesi, J.Johannsen.
On the Relative Complexity of the Resolution Refinements and
Cutting Planes Proof Systems. SIAM Journal on Computing.
30(5) pp. 1462-1484. (2000).
[3] S. Caporaso, M. Zito, Nicola Galesi.
A Predicative and Decidable Characterization of the Polynomial
Classes of Languages. Theoretical Computer Science Vol.
251(1-2) pp. 83-99 (2001).
[2] M.L. Bonet, Nicola Galesi.
Linear Lower Bounds and Simulations in Frege Systems with
Substitutions. In Selected Papers of 11-th Computer Science Logic.LNCS.
Vol. 1414 pp. 115-128 (1998).
[1] Nicola Galesi.
A syntactic characterization of bounded-rank decision trees in
terms of decision lists. RAIRO - Theoretical Informatics
and Applications. Vol 31 (2) pp.149-158 (1997).
[20] Nicola Galesi, Pavel Pudlak, Neil
Thapen.
The Space complexity of cutting planes proof systems Conference on Computational Complexity 2015. pp. 433-447
[18] Giuseppe Ateniese, Ilario Bonacina,
Antonio Faonio, Nicola Galesi.
Proofs of Space: When Space Is of the Essence. Security and Cryptography for Networks - 9th International
Conference, SCN 2014 pp. 538-557
[17 ] Ilario Bonacina Nicola Galesi.
Psuedo-Partitions, Transversality and Locality: A
Combinatorial Characterization for the Space Measure in
Algebraic Proof Systems Innovation in Theoretical Computer Science 2013. Berkeley
pp. 455-472
[16] Olaf Beyersdorff, Nicola Galesi,
Massimo Lauria and Alexander Razborov.
Parameterized Bounded-Depth Frege is Not Optimal ICALP 2011 . LNCS (1) 2011. pp. 630-641
[15] Lorenzo Carlucci, Nicola Galesi and
Massimo Lauria.
Paris-Harrington tautologies IEEE 26th Conference on Computational Complexity, 2011.
pp. 93-103.
[9] J.L. Esteban, Nicola Galesi, J.
Messner.
On the Complexity of Resolution with Bounded Conjunctions. International Colloquium on Automata, Languages and
Programming (ICALP 02). Lecture Notes in Computer Science
2380, pp. 220-231, 2002
[8] E. Ben-Sasson, Nicola Galesi.
Space Complexity for Random Formulae in Resolution.
In Proceedings of the IEEE Conference on Computational
Complexity 2001 (CCC 01), pp. 42-51.
[7] A. Atserias, Nicola Galesi, P.
Pudlak.
Monotone Simulations of nonmonotone Propositional Proofs. IEEE Conference on Computational Complexity 2001 (CCC 01),
pp. 36-41.
[6] A. Atserias, Nicola Galesi, R.
Gavalda.
Monotone Proofs of the Pigeon Hole Principle. International Colloquium on Automata and Language
Programming, (ICALP 00). Lecture Notes in Computer Science
Vol. 1853. pp. 151-162 (2000).
[5] M.L. Bonet, Nicola Galesi.
A Study of Proof Search Algorithms for Resolution and
Polynomial Calculus. 40-th IEEE Symposium on Foundations of Computer Science
(FOCS 99) pp.422-431 (1999).
[3] M.L. Bonet, Nicola Galesi.
Linear Lower Bounds and Simulations in Frege Systems with
Substitutions. 11-th Computer Science Logic. pp. 109-119 (CSL
97)
[2] S. Caporaso,M. Zito, Nicola Galesi,
E. Covino.
Syntactic Characterization in LISP of the Polynomial
Complexity Classes and Hierarchy. Proceedings of the 3rd Italian Conference on Algorithms
and Complexity (CIAC 97). Lecture Notes in Computer Science.
1203, pp. 61-73 (1997)