Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nicola Galesi
2010 – today
- 2013
[c17]Ilario Bonacina, Nicola Galesi: Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. ITCS 2013: 455-472- 2012
- [j14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege Is not Optimal. TOCT 4(3): 7 (2012)
- [i14]Nadia Creignou, Nicola Galesi, Oliver Kullmann, Heribert Vollmer: SAT Interactions (Dagstuhl Seminar 12471). Dagstuhl Reports 2(11): 87-101 (2012)
- [i13]Ilario Bonacina, Nicola Galesi: Pseudo-partitions, Transversality and Locality: A Combinatorial Characterization for the Space Measure in Algebraic Proof Systems. Electronic Colloquium on Computational Complexity (ECCC) 19: 119 (2012)
- [i12]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: A Characterization of Tree-Like Resolution Size. Electronic Colloquium on Computational Complexity (ECCC) 19: 161 (2012)
- 2011
- [c16]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria: Paris-Harrington Tautologies. IEEE Conference on Computational Complexity 2011: 93-103
- [c15]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641
- [c14]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18
- 2010
- [j13]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Inf. Process. Lett. 110(23): 1074-1077 (2010)
- [j12]Nicola Galesi, Massimo Lauria: On the Automatizability of Polynomial Calculus. Theory Comput. Syst. 47(2): 491-506 (2010)
- [j11]Nicola Galesi, Massimo Lauria: Optimality of size-degree tradeoffs for polynomial calculus. ACM Trans. Comput. Log. 12(1): 4 (2010)
- [i11]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Hardness of Parameterized Resolution. Electronic Colloquium on Computational Complexity (ECCC) 17: 59 (2010)
- [i10]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games. Electronic Colloquium on Computational Complexity (ECCC) 17: 81 (2010)
- [i9]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria: Paris-Harrington tautologies. Electronic Colloquium on Computational Complexity (ECCC) 17: 153 (2010)
- [i8]Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege is Not Optimal. Electronic Colloquium on Computational Complexity (ECCC) 17: 198 (2010)
2000 – 2009
- 2009
- [i7]Nicola Galesi, Massimo Lauria: On the Automatizability of Polynomial Calculus. Electronic Colloquium on Computational Complexity (ECCC) 16: 35 (2009)
- 2007
- [i6]Nicola Galesi, Massimo Lauria: Extending Polynomial Calculus to $k$-DNF Resolution. Electronic Colloquium on Computational Complexity (ECCC) 14(041) (2007)
- 2006
- [j10]Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures. Theory of Computing 2(1): 65-90 (2006)
- 2005
- [c13]
- 2004
- [j9]Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004)
- [c12]Nicola Galesi, Neil Thapen: The Complexity of Treelike Systems over lamda-Local Formulae. IEEE Conference on Computational Complexity 2004: 68-74
- [c11]Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004
- [c10]Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104
- [i5]Nicola Galesi, Neil Thapen: Resolution and pebbling games. Electronic Colloquium on Computational Complexity (ECCC)(112) (2004)
- 2003
- [j8]Maria Luisa Bonet, Nicola Galesi: Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42(5): 403-414 (2003)
- [j7]Eli Ben-Sasson, Nicola Galesi: Space complexity of random formulae in resolution. Random Struct. Algorithms 23(1): 92-109 (2003)
- [c9]Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi: Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. FOCS 2003: 318-327
- 2002
- [j6]Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65(4): 626-638 (2002)
- [c8]Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231
- 2001
- [j5]Maria Luisa Bonet, Nicola Galesi: Optimality of size-width tradeoffs for resolution. Computational Complexity 10(4): 261-276 (2001)
- [j4]Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. Math. Log. Q. 47(4): 461-474 (2001)
- [j3]Salvatore Caporaso, Michele Zito, Nicola Galesi: A predicative and decidable characterization of the polynomial classes of languages. Theor. Comput. Sci. 250(1-2): 83-99 (2001)
- [c7]Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone Simulations of Nonmonotone Proofs. IEEE Conference on Computational Complexity 2001: 36-41
- [c6]Eli Ben-Sasson, Nicola Galesi: Space Complexity of Random Formulae in Resolution. IEEE Conference on Computational Complexity 2001: 42-51
- [i4]Eli Ben-Sasson, Nicola Galesi: Space Complexity of Random Formulae in Resolution. Electronic Colloquium on Computational Complexity (ECCC) 8(31) (2001)
- 2000
- [j2]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5): 1462-1484 (2000)
- [c5]Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. ICALP 2000: 151-162
- [i3]Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. Electronic Colloquium on Computational Complexity (ECCC) 7(8) (2000)
- [i2]Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone simulations of nonmonotone propositional proofs. Electronic Colloquium on Computational Complexity (ECCC) 7(87) (2000)
1990 – 1999
- 1999
- [c4]Maria Luisa Bonet, Nicola Galesi: A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432
- 1998
- [c3]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647
- [i1]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Electronic Colloquium on Computational Complexity (ECCC) 5(35) (1998)
- 1997
- [j1]Nicola Galesi: A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. ITA 31(2): 149-158 (1997)
- [c2]Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino: Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC 1997: 61-73
- [c1]Maria Luisa Bonet, Nicola Galesi: Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL 1997: 115-128
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-12 20:32 CEST by the dblp team