Pages that link to "Item:Q2892684"
From MaRDI portal
The following pages link to Sharpened lower bounds for cut elimination (Q2892684):
Displaying 11 items.
- Strengthening lattice-free cuts using non-negativity (Q429683) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- On the sharpness of some results relating cuts and crossing numbers (Q986698) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
- (Q4234107) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- Cut-Elimination for SBL (Q5013907) (← links)
- Computer Science Logic (Q5292638) (← links)
- Elementary elimination of prenex cuts in disjunction-free intuitionistic logic (Q5351952) (← links)