| 2004 |
|---|
| 13 | EE | Juan Luis Esteban,
Nicola Galesi,
Jochen Messner:
On the complexity of resolution with bounded conjunctions.
Theor. Comput. Sci. 321(2-3): 347-370 (2004) |
| 2003 |
|---|
| 12 | EE | Juan Luis Esteban,
Jacobo Torán:
A Combinatorial Characterization of Treelike Resolution Space
Electronic Colloquium on Computational Complexity (ECCC)(044): (2003) |
| 11 | EE | Juan Luis Esteban,
Jacobo Torán:
A combinatorial characterization of treelike resolution space.
Inf. Process. Lett. 87(6): 295-300 (2003) |
| 2002 |
|---|
| 10 | EE | Juan Luis Esteban,
Nicola Galesi,
Jochen Messner:
On the Complexity of Resolution with Bounded Conjunctions.
ICALP 2002: 220-231 |
| 9 | EE | Albert Atserias,
Maria Luisa Bonet,
Juan Luis Esteban:
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution.
Inf. Comput. 176(2): 136-152 (2002) |
| 2001 |
|---|
| 8 | EE | Albert Atserias,
Maria Luisa Bonet,
Juan Luis Esteban:
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.
ICALP 2001: 1005-1016 |
| 7 | | S. Baumer,
Juan Luis Esteban,
Jacobo Torán:
Minimally Unsatisfiable CNF Formulas.
Bulletin of the EATCS 74: 190-192 (2001) |
| 6 | | Juan Luis Esteban,
Jacobo Torán:
Space Bounds for Resolution.
Inf. Comput. 171(1): 84-97 (2001) |
| 2000 |
|---|
| 5 | EE | Sergio Díaz,
Juan Luis Esteban,
Mitsunori Ogihara:
A DNA-Based Random Walk Method for Solving k-SAT.
DNA Computing 2000: 209-219 |
| 4 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
SIAM J. Comput. 30(5): 1462-1484 (2000) |
| 1999 |
|---|
| 3 | EE | Juan Luis Esteban,
Jacobo Torán:
Space Bounds for Resolution.
STACS 1999: 551-560 |
| 1998 |
|---|
| 2 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems.
FOCS 1998: 638-647 |
| 1 | EE | Maria Luisa Bonet,
Juan Luis Esteban,
Nicola Galesi,
Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
Electronic Colloquium on Computational Complexity (ECCC) 5(35): (1998) |
