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
[2]
Hilfe
Suche: Author="Esteban, Juan Luis"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
A combinatorial characterization of treelike resolution space
Juan Luis Esteban
,
Jacobo Torán
Information Processing Letters
87
(6), 2003, pp. 295-300
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
Albert Atserias
,
Maria Luisa Bonet
,
Juan Luis Esteban
Information and Computation
176
(2), 2002, pp. 136-152
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
Lower bounds for the weak pigeonhole principle beyond resolution
Albert Atserias
,
María Luisa Bonet
,
Juan Luis Esteban
Lecture Notes in Computer Science
2076
, 2001, pp. 1005-1016
Space bounds for resolution
Juan Luis Esteban
,
Jacobo Torán
Information and Computation
171
(1), 2001, pp. 84-97
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
Space bounds for resolution
Juan Luis Esteban
,
Jacobo Torán
Lecture Notes in Computer Science
1563
, 1999, pp. 551-560
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