| 2007 |
|---|
| 29 | EE | Nicola Galesi,
Massimo Lauria:
Extending Polynomial Calculus to $k$-DNF Resolution.
Electronic Colloquium on Computational Complexity (ECCC) 14(041): (2007) |
| 2006 |
|---|
| 28 | EE | 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 | EE | Nicola Galesi,
Neil Thapen:
Resolution and Pebbling Games.
SAT 2005: 76-90 |
| 2004 |
|---|
| 26 | EE | Nicola Galesi,
Neil Thapen:
The Complexity of Treelike Systems over lamda-Local Formulae.
IEEE Conference on Computational Complexity 2004: 68-74 |
| 25 | EE | Nicola Galesi,
Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
SAT 2004 |
| 24 | EE | Nicola Galesi,
Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
SAT (Selected Papers 2004: 89-104 |
| 23 | EE | Nicola Galesi,
Neil Thapen:
Resolution and pebbling games
Electronic Colloquium on Computational Complexity (ECCC)(112): (2004) |
| 22 | EE | 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 | EE | Josh Buresh-Oppenheim,
Nicola Galesi,
Shlomo Hoory,
Avner Magen,
Toniann Pitassi:
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.
FOCS 2003: 318- |
| 20 | EE | Maria Luisa Bonet,
Nicola Galesi:
Degree complexity for a modified pigeonhole principle.
Arch. Math. Log. 42(5): 403-414 (2003) |
| 19 | EE | Eli Ben-Sasson,
Nicola Galesi:
Space complexity of random formulae in resolution.
Random Struct. Algorithms 23(1): 92-109 (2003) |
| 2002 |
|---|
| 18 | EE | Juan Luis Esteban,
Nicola Galesi,
Jochen Messner:
On the Complexity of Resolution with Bounded Conjunctions.
ICALP 2002: 220-231 |
| 17 | EE | Albert Atserias,
Nicola Galesi,
Pavel Pudlák:
Monotone simulations of non-monotone proofs.
J. Comput. Syst. Sci. 65(4): 626-638 (2002) |
| 2001 |
|---|
| 16 | EE | Albert Atserias,
Nicola Galesi,
Pavel Pudlák:
Monotone Simulations of Nonmonotone Proofs.
IEEE Conference on Computational Complexity 2001: 36-41 |
| 15 | EE | Eli Ben-Sasson,
Nicola Galesi:
Space Complexity of Random Formulae in Resolution.
IEEE Conference on Computational Complexity 2001: 42-51 |
| 14 | EE | Maria Luisa Bonet,
Nicola Galesi:
Optimality of size-width tradeoffs for resolution.
Computational Complexity 10(4): 261-276 (2001) |
| 13 | EE | Eli Ben-Sasson,
Nicola Galesi:
Space Complexity of Random Formulae in Resolution
Electronic Colloquium on Computational Complexity (ECCC) 8(31): (2001) |
| 12 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle.
Math. Log. Q. 47(4): 461-474 (2001) |
| 11 | EE | 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 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle.
ICALP 2000: 151-162 |
| 9 | EE | Albert Atserias,
Nicola Galesi,
Ricard Gavaldà:
Monotone Proofs of the Pigeon Hole Principle
Electronic Colloquium on Computational Complexity (ECCC) 7(8): (2000) |
| 8 | EE | Albert Atserias,
Nicola Galesi,
Pavel Pudlák:
Monotone simulations of nonmonotone propositional proofs
Electronic Colloquium on Computational Complexity (ECCC) 7(87): (2000) |
| 7 | EE | 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 | EE | Maria Luisa Bonet,
Nicola Galesi:
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus.
FOCS 1999: 422-432 |
| 1998 |
|---|
| 5 | EE | 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 | EE | 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) |
