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="Bonet, Maria Luisa"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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 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
On interpolation and automatization for Frege systems
Maria Luisa Bonet
,
Toniann Pitassi
,
Ran Raz
SIAM Journal on Computing
29
(6), 2000, pp. 1939-1967
Non-automatizability of bounded-depth Frege proofs
Maria Luisa Bonet
,
Carlos Domingo
,
Ricard GavaldÃ
,
Alexis Maciel
,
Toniann Pitassi
Proceedings of the 14th Annual IEEE Conference on Computational Complexity (Atlanta, Georgia, May 4-6, 1999)
, 1999, pp. 15-23
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
No feasible interpolation for
TC^0
-Frege proofs
Maria Luisa Bonet
,
Toniann Pitassi
,
Ran Raz
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 254-263
The serial transitive closure problem for trees
Maria Luisa Bonet
,
Samuel R. Buss
SIAM Journal on Computing
24
(1), 1995, February, pp. 109-122
Size-depth tradeoffs for Boolean formulae
Maria Luisa Bonet
,
Samuel R. Buss
Information Processing Letters
49
, 1994, pp. 151-155