The following pages link to (Q4736859):
Displaying 14 items.
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- Algebraic proof systems over formulas. (Q1401356) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- (Q5005186) (← links)
- (Q5091238) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- (Q5121904) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
