Juan Luis Esteban

Publications

475

Citations

H-Index

2000

Active since

Affiliations

Universitat Politècnica de Catalunya(Current)

Universidade da Coruña

Juan Luis Esteban is an author at Universitat Politècnica de Catalunya specializing in engineering, computational complexity, and discrete mathematics.

ORCID

Top concepts

EngineeringComputational ComplexityFormal MethodsComputer ScienceProof ComplexityAutomated ReasoningDiscrete MathematicsMathematical ProgrammingCircuit ComplexityComputational Geometry

Publications per year

2000–2017

Publications

On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

Marı́a Luisa Bonet, Juan Luis Esteban, Nicola Galesi et al. · SIAM Journal on Computing · 2000 · 117 citations

Mathematical Programming, Circuit Complexity, Computational Complexity Theory +17

Space Bounds for Resolution

Juan Luis Esteban, Jacobo Torán · Information and Computation · 2001 · 116 citations

Mathematical Programming, Computational Complexity Theory, Engineering +7

A combinatorial characterization of treelike resolution space

Juan Luis Esteban, Jacobo Torán · Information Processing Letters · 2003 · 60 citations

Tree Language, Engineering, Graph Theory +7

On the complexity of resolution with bounded conjunctions

Juan Luis Esteban, Nicola Galesi · Theoretical Computer Science · 2004 · 45 citations

Computational Complexity Theory, Engineering, Automated Reasoning +6

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution

Albert Atserias, Marı́a Luisa Bonet, Juan Luis Esteban · Information and Computation · 2002 · 40 citations

Engineering, Proof Complexity, Lower Bound +9

Rows per page

1–5 of 10