| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
Parameterized Bounded-Depth Frege Is Not Optimal.  |
ICALP  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
Parameterized Complexity of DPLL Search Procedures. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington Tautologies. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Carlucci, Nicola Galesi, Massimo Lauria |
Paris-Harrington tautologies. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov |
Parameterized Bounded-Depth Frege is Not Optimal. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
Hardness of Parameterized Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
On the Automatizability of Polynomial Calculus. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
Optimality of size-degree tradeoffs for polynomial calculus. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
On the Automatizability of Polynomial Calculus. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Massimo Lauria |
Extending Polynomial Calculus to $k$-DNF Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Joshua Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi |
Rank Bounds and Integrality Gaps for Cutting Planes Procedures. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Neil Thapen |
Resolution and Pebbling Games. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Neil Thapen |
Resolution and pebbling games |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Juan Luis Esteban, Nicola Galesi, Jochen Messner |
On the complexity of resolution with bounded conjunctions. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Oliver Kullmann |
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. |
SAT |
2004 |
DBLP BibTeX RDF |
|
| 1 | Nicola Galesi, Oliver Kullmann |
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Galesi, Neil Thapen |
The Complexity of Treelike Systems over lamda-Local Formulae. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space complexity of random formulae in resolution. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Nicola Galesi |
Degree complexity for a modified pigeonhole principle. |
Arch. Math. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Buresh-Oppenheim, Nicola Galesi, Shlomo Hoory, Avner Magen, Toniann Pitassi |
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Pavel Pudlák |
Monotone simulations of non-monotone proofs. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan Luis Esteban, Nicola Galesi, Jochen Messner |
On the Complexity of Resolution with Bounded Conjunctions. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Ricard Gavaldà |
Monotone Proofs of the Pigeon Hole Principle. |
Math. Log. Q. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Salvatore Caporaso, Michele Zito, Nicola Galesi |
A predicative and decidable characterization of the polynomial classes of languages. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Nicola Galesi |
Optimality of size-width tradeoffs for resolution. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
complexity of proofs, automated theorem proving.¶ Subject classification. 03F20, 03B05, Resolution, 68T15 |
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Pavel Pudlák |
Monotone Simulations of Nonmonotone Proofs. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Pavel Pudlák |
Monotone simulations of nonmonotone propositional proofs |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Ricard Gavaldà |
Monotone Proofs of the Pigeon Hole Principle |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias, Nicola Galesi, Ricard Gavaldà |
Monotone Proofs of the Pigeon Hole Principle. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Nicola Galesi |
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen |
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
Cutting Planes proof, tree-like proof, regular resolution, Davis-Putnam resolution, monotone real circuit, real communication complexity, lower bounds, resolution, propositional proof complexity |
| 1 | Nicola Galesi |
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. |
ITA |
1997 |
DBLP BibTeX RDF |
|
| 1 | Maria Luisa Bonet, Nicola Galesi |
Linear Lower Bounds and Simulations in Frege Systems with Substitutions. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino |
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")