Nicola Galesi

	2011
40		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov: Parameterized Bounded-Depth Frege Is Not Optimal. ICALP (1) 2011: 630-641
39		Lorenzo Carlucci, Nicola Galesi, Massimo Lauria: Paris-Harrington Tautologies. IEEE Conference on Computational Complexity 2011: 93-103
38		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Parameterized Complexity of DPLL Search Procedures. SAT 2011: 5-18
	2010
37		Nicola Galesi, Massimo Lauria: Optimality of size-degree tradeoffs for polynomial calculus. ACM Trans. Comput. Log. 12(1): 4 (2010)
36		Lorenzo Carlucci, Nicola Galesi, Massimo Lauria: Paris-Harrington tautologies. Electronic Colloquium on Computational Complexity (ECCC) 17: 153 (2010)
35		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)
34		Olaf Beyersdorff, Nicola Galesi, Massimo Lauria: Hardness of Parameterized Resolution. Electronic Colloquium on Computational Complexity (ECCC) 17: 59 (2010)
33		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)
32		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)
31		Nicola Galesi, Massimo Lauria: On the Automatizability of Polynomial Calculus. Theory Comput. Syst. 47(2): 491-506 (2010)
	2009
30		Nicola Galesi, Massimo Lauria: On the Automatizability of Polynomial Calculus. Electronic Colloquium on Computational Complexity (ECCC) 16: 35 (2009)
	2007
29		Nicola Galesi, Massimo Lauria: Extending Polynomial Calculus to $k$-DNF Resolution. Electronic Colloquium on Computational Complexity (ECCC) 14(041): (2007)
	2006
28		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
27		Nicola Galesi, Neil Thapen: Resolution and Pebbling Games. SAT 2005: 76-90
	2004
26		Nicola Galesi, Neil Thapen: The Complexity of Treelike Systems over lamda-Local Formulae. IEEE Conference on Computational Complexity 2004: 68-74
25		Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004
24		Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104
23		Nicola Galesi, Neil Thapen: Resolution and pebbling games Electronic Colloquium on Computational Complexity (ECCC)(112): (2004)
22		Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the complexity of resolution with bounded conjunctions. Theor. Comput. Sci. 321(2-3): 347-370 (2004)
	2003
21		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
20		Maria Luisa Bonet, Nicola Galesi: Degree complexity for a modified pigeonhole principle. Arch. Math. Log. 42(5): 403-414 (2003)
19		Eli Ben-Sasson, Nicola Galesi: Space complexity of random formulae in resolution. Random Struct. Algorithms 23(1): 92-109 (2003)
	2002
18		Juan Luis Esteban, Nicola Galesi, Jochen Messner: On the Complexity of Resolution with Bounded Conjunctions. ICALP 2002: 220-231
17		Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone simulations of non-monotone proofs. J. Comput. Syst. Sci. 65(4): 626-638 (2002)
	2001
16		Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone Simulations of Nonmonotone Proofs. IEEE Conference on Computational Complexity 2001: 36-41
15		Eli Ben-Sasson, Nicola Galesi: Space Complexity of Random Formulae in Resolution. IEEE Conference on Computational Complexity 2001: 42-51
14		Maria Luisa Bonet, Nicola Galesi: Optimality of size-width tradeoffs for resolution. Computational Complexity 10(4): 261-276 (2001)
13		Eli Ben-Sasson, Nicola Galesi: Space Complexity of Random Formulae in Resolution Electronic Colloquium on Computational Complexity (ECCC) 8(31): (2001)
12		Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. Math. Log. Q. 47(4): 461-474 (2001)
11		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)
	2000
10		Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle. ICALP 2000: 151-162
9		Albert Atserias, Nicola Galesi, Ricard Gavaldà: Monotone Proofs of the Pigeon Hole Principle Electronic Colloquium on Computational Complexity (ECCC) 7(8): (2000)
8		Albert Atserias, Nicola Galesi, Pavel Pudlák: Monotone simulations of nonmonotone propositional proofs Electronic Colloquium on Computational Complexity (ECCC) 7(87): (2000)
7		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)
	1999
6		Maria Luisa Bonet, Nicola Galesi: A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. FOCS 1999: 422-432
	1998
5		Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647
4		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
3		Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino: Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. CIAC 1997: 61-73
2		Maria Luisa Bonet, Nicola Galesi: Linear Lower Bounds and Simulations in Frege Systems with Substitutions. CSL 1997: 115-128
1		Nicola Galesi: A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. ITA 31(2): 149-158 (1997)

Coauthor Index

1	Albert Atserias	[8] [9] [10] [12] [16] [17]
2	Eli Ben-Sasson	[13] [15] [19]
3	Olaf Beyersdorff	[32] [33] [34] [35] [38] [40]
4	Maria Luisa Bonet	[2] [4] [5] [6] [7] [14] [20]
5	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[21] [28]
6	Salvatore Caporaso	[3] [11]
7	Lorenzo Carlucci	[36] [39]
8	Emanuele Covino	[3]
9	Juan Luis Esteban	[4] [5] [7] [18] [22]
10	Ricard Gavaldà	[9] [10] [12]
11	Shlomo Hoory	[21] [28]
12	Jan Johannsen	[4] [5] [7]
13	Oliver Kullmann	[24] [25]
14	Massimo Lauria	[29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40]
15	Avner Magen	[21] [28]
16	Jochen Messner (Jochen Meßner)	[18] [22]
17	Toniann Pitassi	[21] [28]
18	Pavel Pudlák	[8] [16] [17]
19	Alexander A. Razborov	[35] [40]
20	Neil Thapen	[23] [26] [27]
21	Michele Zito	[3] [11]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page