Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Galesi, Nicola"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of tree-like Resolution size
Olaf Beyersdorff
,
Nicola Galesi
,
Massimo Lauria
Information Processing Letters
113
(18), 2013, pp. 666-671
Parameterized bounded-depth Frege is not optimal
Olaf Beyersdorff
,
Nicola Galesi
,
Massimo Lauria
,
Alexander Razborov
Lecture Notes in Computer Science
6755
, 2011, pp. 630-641
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), 2010, pp. 1074-1077
On the automatizability of polynomial calculus
Nicola Galesi
,
Massimo Lauria
Theory of Computing Systems
47
(2), 2010, pp. 491-506
On the complexity of resolution with bounded conjunctions
Juan Luis Esteban
,
Nicola Galesi
,
Jochen Messner
Theoretical Computer Science
321
(2-3), 2004, pp. 347-370
Monotone simulations of non-monotone proofs
Albert Atserias
,
Nicola Galesi
,
Pavel Pudlák
Journal of Computer and System Sciences
65
(4), 2002, pp. 626-638
On the complexity of resolution with bounded conjunctions
Juan Luis Esteban
,
Nicola Galesi
,
Jochen Messner
Lecture Notes in Computer Science
2380
, 2002, pp. 220-231
Monotone proofs of the pigeon hole principle
Albert Atserias
,
Nicola Galesi
,
Ricard Gavaldà
Lecture Notes in Computer Science
1853
, 2000, pp. 151-162
Monotone proofs of the pigeon hole principle
Albert Atserias
,
Nicola Galesi
,
Ricard Gavalda
Technical Report (TR00-008), 2000
Monotone simulations of nonmonotone proofs
Albert Atserias
,
Nicola Galesi
,
Pavel Pudlák
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 36-41
Space complexity of random formulae in resolution
Eli Ben-Sasson
,
Nicola Galesi
Proceedings of the 16th Annual IEEE Conference on Computational Complexity (Chicago, Illinois, June 18-21, 2001)
, 2000, pp. 42-51
On the relative complexity of resolution refinements and cutting planes proof systems
Maria Luisa Bonet
,
Juan Luis Esteban
,
Nicola Galesi
,
Jan Johannsen
SIAM Journal on Computing
30
(5), 2000, pp. 1462-1484
Exponential separations between restricted resolution and cutting planes proof systems
Maria Luisa Bonet
,
Juan Luis Esteban
,
Nicola Galesi
,
Jan Johannsen
Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS'98 (Palo Alto, California, November 8-11, 1998)
, 1998, pp. 638-647
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73