Items where authors include "Galesi, N"

Article

Beyersdorff, O, Galesi, N and Lauria, M (2013) Parameterized complexity of DPLL search procedures. ACM Transactions on Computational Logic, 14 (3). 20. ISSN 1529-3785

Beyersdorff, O, Galesi, N and Lauria, M (2013) A characterization of tree-like resolution size. Information Processing Letters, 113 (18). 666 - 671. ISSN 0020-0190

Beyersdorff, O, Galesi, N, Lauria, M et al. (1 more author) (2012) Parameterized Bounded-Depth Frege Is not Optimal. ACM Transactions on Computation Theory, 4 (3). 7.1 - 7.16 . ISSN 1942-3454

Beyersdorff, O, Galesi, N and Lauria, M (2010) A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Information Processing Letters, 110 (23). 1074 - 1077 . ISSN 0020-0190

Proceedings Paper

Beyersdorff, O, Galesi, N, Lauria, M et al. (1 more author) (2011) Parameterized bounded-depth Frege is not optimal. In: Aceto, L, Henzinger, M and Sgall, J, (eds.) Automata, languages and programmes, proceedings ICALP. ICALP 2011, 04-08 Jul 2011, Zurich, Switzerland. Lecture Notes in Computer Science, 6755 (Part 1). Springer Verlag , 630 - 641 . ISBN 978-3-642-22005-0

Beyersdorff, O, Galesi, N and Lauria, M (2011) Parameterized complexity of DPLL search procedures. In: Sakallah, KA and Simon, L, (eds.) Theory and Applications of Satisfiability Testing - SAT 2011. SAT 2011, 19-22 Jun 2011, Ann Arbor, MI, USA. Springer Verlag , 5 - 18 . ISBN 978-3-642-21580-3