Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Nicola Galesi
Observed names:
GALESI, NICOLA,
Galesi, Nicola,
N. Galesi
Institution:
Sapienza University of Rome
Observed institutions:
University of Toronto,
Institute for Advanced Study,
Sapienza University of Rome,
Universitat Politècnica de Catalunya
ORCID:
0000-0002-8522-362X
Observed ORCID:
0000-0002-8522-362X
OpenAlex ID:
A5084573067
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
2000
·
Maria Luisa Bonet
, Juan Luis Esteban
, et al.
·
SIAM Journal on Computing
·
137
Optimality of size-width tradeoffs for resolution
2001
·
Maria Luisa Bonet
, Nicola Galesi
·
Computational Complexity
·
84
Space complexity of random formulae in resolution
2003
·
Eli Ben‐Sasson
, Nicola Galesi
·
Random Structures and Algorithms
·
78
Rank Bounds and Integrality Gaps for Cutting Planes Procedures
2006
·
Joshua Buresh-Oppenheim
, Nicola Galesi
, et al.
·
Theory of Computing
·
76
PDF
A study of proof search algorithms for resolution and polynomial calculus
2003
·
M.L. Bonet
, N. Galesi
·
Annual Symposium on Foundations of Computer Science
·
60
A characterization of tree-like Resolution size
2013
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
59
PDF
Rank bounds and integrality gaps for cutting planes procedures
2004
·
J. Buresh-Oppenheim
, N. Galesi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
58
Monotone simulations of non-monotone proofs
2002
·
Albert Atserias
, Nicola Galesi
, et al.
·
Journal of Computer and System Sciences
·
53
On the complexity of resolution with bounded conjunctions
2004
·
Juan Luis Esteban
, Nicola Galesi
, et al.
·
Theoretical Computer Science
·
49
Optimality of size-degree tradeoffs for polynomial calculus
2010
·
Nicola Galesi
, Massimo Lauria
·
ACM Transactions on Computational Logic
·
45
Parameterized Complexity of DPLL Search Procedures
2013
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
ACM Transactions on Computational Logic
·
36
PDF
Total Space in Resolution
2016
·
Ilario Bonacina
, Nicola Galesi
, et al.
·
SIAM Journal on Computing
·
35
Monotone Proofs of the Pigeon Hole Principle
2000
·
Albert Atserias
, Nicola Galesi
, et al.
·
Lecture notes in computer science
·
35
Parameterized Bounded-Depth Frege Is Not Optimal
2011
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
ACM Transactions on Computation Theory
·
31
PDF
Exponential separations between restricted resolution and cutting planes proof systems
2002
·
M.L. Bonet
, J.L. Esteban
, et al.
·
Annual Symposium on Foundations of Computer Science
·
31
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
2010
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
27
PDF
On the Automatizability of Polynomial Calculus
2009
·
Nicola Galesi
, Massimo Lauria
·
Theory of Computing Systems
·
27
A Framework for Space Complexity in Algebraic Proof Systems
2015
·
Ilario Bonacina
, Nicola Galesi
·
Journal of the ACM
·
25
Total Space in Resolution
2014
·
Ilario Bonacina
, Nicola Galesi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
22
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
2018
·
Nicola Galesi
, Fariba Ranjbar
·
IEEE International Conference on Distributed Computing Systems (ICDCS)
·
20
PDF
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems
2013
·
Ilario Bonacina
, Nicola Galesi
·
Conference on Innovations in Theoretical Computer Science
·
17
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank
2005
·
Nicola Galesi
, Oliver Kullmann
·
Lecture notes in computer science
·
17
The space complexity of cutting planes refutations
2015
·
Nicola Galesi
, Pavel Pudlák
, et al.
·
Conference on Computational Complexity
·
16
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs
2019
·
Galesi, Nicola
, Itsykson, Dmitry
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
15
PDF
On the Complexity of Resolution with Bounded Conjunctions: Extended Abstract
2002
·
Juan Luis Esteban
, Nicola Galesi
, et al.
·
Lecture notes in computer science
·
15
Show more works
View as search
Works count:
96
Citation count:
1,376
H-index:
20
I10-index:
30
Year
Topic
Type