The following pages link to Juan Luis Esteban (Q1014443):
Displayed 16 items.
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Minimum projective linearizations of trees in linear time (Q2059886) (← links)
- Are crossing dependencies really scarce? (Q2148382) (← links)
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120) (← links)
- (Q2743691) (← links)
- The scaling of the minimum sum of edge lengths in uniformly random trees (Q3302733) (← links)
- (Q4251071) (← links)
- (Q4530863) (← links)
- (Q4535079) (← links)
- (Q4737159) (← links)
- A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees (Q5283240) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
- The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)