引用次数
引用: 1,377
H-指数: 20
I10-指数 : 29
出版物: 77
ACM Transactions of Computation Theory
O Beyersdorff , N Galesi , M Lauria , AA Razborov
ACM Transactions of Computation Theory 4 ( 3) 7 -16
2012
PROCEEDINGS-ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS
A Orlitsky , NP Santhanam , J Zhang , J Buresh-Oppenheim
2003
Hardness of Parameterized Resolution.
Nicola Galesi , Massimo Lauria , Olaf Beyersdorff
Electronic Colloquium on Computational Complexity 17 59
2010
The space complexity of cutting planes refutations
Nicola Galesi , Pavel Pudlák , Neil Thapen
conference on computational complexity 33 433 -447
7
2015
Exponential separation between tree-like and dag-like Cutting Planes proof systems
Nicola Galesi , Jan Johannsen , M. Luisa Bonet Carbonell , Juan Luis Esteban Ángeles
1997
The Width-size method for general resolution is optimal
Nicola Galesi , M. Luisa Bonet Carbonell
1999
Proofs of Space: When Space is of the Essence.
Nicola Galesi , Giuseppe Ateniese , Ilario Bonacina , Antonio Faonio
IACR Cryptology ePrint Archive 2013 805
137
2013
Parameterized Complexity of DPLL Search Procedures
Olaf Beyersdorff , Nicola Galesi , Massimo Lauria
ACM Transactions on Computational Logic 14 ( 3) 20
26
2013
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank
Nicola Galesi , Oliver Kullmann
Theory and Applications of Satisfiability Testing 89 -104
14
2005
Resolution and Pebbling Games
Nicola Galesi , Neil Thapen
Theory and Applications of Satisfiability Testing 76 -90
8
2005
On the complexity of resolution with bounded conjunctions
Juan Luis Esteban , Nicola Galesi , Jochen Messner
Theoretical Computer Science 321 ( 2) 347 -370
42
2004
A characterization of tree-like Resolution size
Olaf Beyersdorff , Nicola Galesi , Massimo Lauria
Information Processing Letters 113 ( 18) 666 -671
20
2013
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games
Olaf Beyersdorff , Nicola Galesi , Massimo Lauria
Information Processing Letters 110 ( 23) 1074 -1077
19
2010
Vertex-Connectivity for Node Failure Identification in Boolean Network Tomography
Nicola Galesi , Fariba Ranjbar , Michele Zito
Algorithms for Sensor Systems 11931 79 -95
2
2019
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies
Lorenzo Carlucci , Nicola Galesi , Massimo Lauria
ACM Transactions on Computational Logic 17 ( 4) 26
2016
Cops-Robber Games and the Resolution of Tseitin Formulas
Nicola Galesi , Navid Talebanfard , Jacobo Torán
ACM Transactions on Computation Theory 12 ( 2) 1 -22
2
2020
Degree complexity for a modified pigeonhole principle
Maria Luisa Bonet , Nicola Galesi
Archive for Mathematical Logic 42 ( 5) 403 -414
1
2003
Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography
Nicola Galesi , Fariba Ranjbar
international conference on distributed computing systems 212 -222
7
2018
Space complexity of random formulae in resolution
Eli Ben-Sasson , Nicola Galesi
Random Structures and Algorithms 23 ( 1) 92 -109
63
2003
Optimality of size-degree tradeoffs for polynomial calculus
Nicola Galesi , Massimo Lauria
ACM Transactions on Computational Logic 12 ( 1) 1 -22
24
2010