The following pages link to (Q4736859):
Displaying 25 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)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← 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)
- A framework for space complexity in algebraic proof systems (Q2796410) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- The relation between polynomial calculus, Sherali-Adams, and sum-of-squares proofs (Q3304105) (← links)
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness (Q4598235) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q4807964) (← links)
- (Q5005186) (← links)
- (Q5091238) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- (Q5121904) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Sum of Squares Bounds for the Empty Integral Hull Problem (Q6081967) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
