The following pages link to (Q5092485):
Displaying 16 items.
- A defense of branching quantification (Q1313374) (← links)
- The treewidth of proofs (Q2013559) (← links)
- Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- (Q5028438) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- (Q5874198) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Compressing branch-and-bound trees (Q6086013) (← links)
- Depth lower bounds in Stabbing Planes for combinatorial principles (Q6137876) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- On computing small variable disjunction branch-and-bound trees (Q6589747) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
