The following pages link to (Q4993273):
Displaying 9 items.
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Reflections on Proof Complexity and Counting Principles (Q5027248) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- (Q5092485) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
