Pages that link to "Item:Q4254700"
From MaRDI portal
The following pages link to Discretely ordered modules as a first-order extension of the cutting planes proof system (Q4254700):
Displaying 13 items.
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Several notes on the power of Gomory-Chvátal cuts (Q2498920) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Parametric Presburger arithmetic: logic, combinatorics, and quasi-polynomial behavior (Q4645009) (← links)
- Stabbing planes (Q4993273) (← links)
- (Q5092485) (← links)
- Monotone circuit lower bounds from resolution (Q5140848) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
